Gabbay, Dov M. ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
External co-authors :
yes
Title :
What is a Logical System? An Evolutionary View: 1964-2014
Abraham M., Belfer I., Gabbay D., Schild U. Delegation, count as and security in Talmudic logic, a preliminary study. Logic without Frontiers: Festschrift for Walter Alexandre Carnielli on the occasion of his 60th Birthday 2011, 73-96. College Publications, London, Volume 17 of Tribute Series. J.-Y. Béziau, M.E. Coniglio (Eds.).
Alchourrón C.E., Gärdenfors P., Makinson D. On the logic of theory change: partial meet contraction and revision functions. Journal of Symbolic Logic 1985, 50:510-530.
Allwein J., Barwise Logical Reasoning with Diagrams 1996, Studies in Logic and Computation.
Arieli O., Avron A., Zamansky A. Ideal paraconsistent logics. Studia Logca 2011, 99(1-3):31-60.
A. Avron. Paraconsistemcy, paracompleteness, Gentzen systems, and trivalent semantics. Jouranl of Applied Non-classical Logic, DOI: 10.1080/11663081.2014.911515.
Avon A., Lev I. Non-deterministic multi-valued structures. Journal of Logic and Computation 2005, 15:241-261.
Avron A., Zamansky A. Non deterministic semantics for logical systems. A survey. Handbook of Philosophical Logic 2011, Vol 16:227-304. Kluwer. D. Gabbay, F. Guenthner (Eds.).
Barringer H., Gabbay D.M., Rydeheard D. Reactive grammars. Language, Culture, Computation 2009, LNCS. Springer, In honour of Yakov Choueka, to appear. N. Dershowitz, E. Nissan (Eds.).
Barringer H., Havelund K., Rydeheard D. Rule systems for run-time monitoring: from Eagle to RuleR (extended version). Journal of Logic and Computation 2010, 20(3):675-706. Oxford University Press.
Barringer H., Gabbay D., Woods J. Temporal, Numerical and Metalevel Dynamics in Argumentation Networks. Argumentation and Computation 2012, 3(2-3):143-202.
Barwise J., Seligman J. Information Flow: The Logic of Distributed Systems 2008, Cambridge Tracts in Theoretical Computer Science.
Barwise J., Perry J. Situations and Attitudes 1983, A Bradford Book/MIT Press.
Batens D., De Clercq K., Kurtonina N. Embedding and interpolation for some paralogics. The propositional cse. reports on Mathematical Logic 1999, 33:29-44.
van Benthem J. An essay on sabotage and obstruction. Mechanizing Mathematical Reasoning 2005, 268-276. Springer, volume 2605 of Lecture Notes in Computer Science. D. Hutter, W. Stephan (Eds.).
The Age of Alternative Logics: Assessing Philosophy of Logic and Mathematics Today 2009, Springer, (Logic, Epistemology, and the Unity of Science). J. van Benthem, G. Heinzmann, M. Rebuschi (Eds.).
van Benthem J. Logic in Games 2014, MIT Press.
Proof computation and Agency: Logic at the Crossroads 2011, SPringer. J. van Benthem, A. Gupta, R. Parikh (Eds.).
van Benthem J. Logical Dynamics of Information and Interaction 2011, Cambridge University Press.
Beziau J.Y. Classical negation can be expressed by one of its halves. Logic Journal of the IGPL 1999, 7:145-151.
Boole G. The Mathematical Analysis of Logic 1847, Cambridge and London.
Brown Boolean Reasoning: The Logic of Boolean Equations 2012, Dover.
Cadoli M., Schaerf M. Approximate reasoning and non-omniscient agents 1992, 169-183. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA.
Caminada Martin, Amgoud Leila On the evaluation of argumentation formalisms. Artificial Intelligence 2007, 171(5-6):286-310.
Console L., Dupre D.T., Torasso P. On the relationship between deduction and abduction. Journal of Logic and Computation 1991, 1:661-690.
Couturat L. The Algebra of Logic 1914, Open Court.
M. Crochemore and D. M. Gabbay. Reactive Automata. Information and Computation, 209(4), 692-704. Published online: DOI: 10.1016/j.ic.2011.01.002.
Cross Rupert On Evidence 1999, Butterworth.
D'Agostino M., Floridi L. The enduring scandal of deduction: Is propositional logic really uninformative?. Synthese 2009, 167:271-315.
D'Agostino M., Finger M., Gabbay D.M. Semantics and proof-theory of depth-bounded Boolean logics. Theoretical Computer Science 2013, 480:43-68.
D'Agostino M., Gabbay D.M. Feasible Deduction for Realistic Agents 2014, College Publications.
Dalal M. Anytime families of tractable propositional reasoners 1996, 42-45.
Dalal M. Anytime families of tractable propositional reasoners. Annals of Mathematics and Artificial Intelligence 1998, 22:297-318.
Dennis H. Law of Evidence 1992, Sweet and Maxwell.
Finger M. Polynomial approximations of full propositional logic via limitedbivalence 2004, 526-538. Springer, volume 3229 of Lecture Notes in Articial Intelligence.
Finger M. Towards polynomial approximations of full propositional logic 2004, 11-20. Springer, volume 3171 of Lecture Notes in Artificial Intellingence. A.L.C. Bazzan, S. Labidi (Eds.).
Finger M., Gabbay D.M. Cut and pay. Journal of Logic, Language and Information 2006, 15(3):195-218.
Finger M., Wassermann R. Approximate and limited reasoning: Semantics, proof theory, expressivity and control. Journal of Logic and Computation 2004, 14(2):179-204.
Finger M., Wassermann R. The universe of propositional approximations. Theoretical Computer Science 2006, 355(2):153-166.
Gabbay D. Semantic proof of the Craig interpolation theorem for intuitionistic logic. Logic Colloquium '69 1969, 391-410. North-Holland.
Gabbay Semantical Investigations in Modal and Temporal Logics 1976, D. Reidel.
Gabbay D. Theoretical foundations for non monotonic reasoning in expert system. Logics and Models of Concurrent Systems 1985, 439-459. Springer-Verlag, Berlin. K. Apt (Ed.).
Gabbay Investigations in Heyting Intuitionistic Logic 1986, D. Reidel.
Gabbay D. Theory of algorithmic proof. Handbook of Logic in Theoretical Computer Science, Volume 1 1992, 307-408. Oxford University Press. S. Abramsky, D. Gabbay, T. Maibaum (Eds.).
Gabbay D. Classical vs. nonclassical logic. Handbook of Logic in AI and Logic Programming, Volume 1 1993, 349-489. Oxford University Press. D.M. Gabbay, C.J. Hogger, J.A. Robinson (Eds.).
Gabbay D. General theory of structured consequence relations. Substructural Logics 1993, 109-151. Studies in Logic and Computation, Oxford University Press. K. Došen, P. Schrëder-Heister (Eds.).
Gabbay D.M. What is a Logical System? 1994, Oxford University Press.
Gabbay D.M. Labelled Deductive Systems 1996, Oxford University Press, Vol. 1.
Gabbay D.M. Elementary Logic 1998, Prentice Hall.
Gabbay D.M. Fibring Logics 1999, OUP.
Gabbay D. Semantics for higher level attacks in extended argumentation frames Part 1 : Overview. Studia Logica 2009, 93:355-379.
Gabbay D. An Equational Approach to Argumentation Networks. Argument and Computation 2012, vol 3(issues (2-3)):87-142.
Gabbay D. Reactive Beth tableaux for modal logic. AMAI 2012, vol 66(issue 1-4):55-79.
Gabbay D.M. Equational approach to default logic 2012, 90. In preparation.
Gabbay D. Bipolar argumentation frames and contrary to duty obligations, a position paper 2012, 1-24. Springer, LNAI 7486. M. Fisher (Ed.).
Gabbay D. Temporal deontic logic for the generalised Chisholm set of contrary to duty obligations 2012, 91-107. Springer, Heidelberg, LNAI 7393. T. Agotnes, J. Broersen, D. Elgesem (Eds.).
Gabbay Reactive Kripke Semantics, Theory and Applications 2013, 450. Springer.
Gabbay D. Meta-Logical Investigations in Argumentation Networks 2013, 770. Research Monograph College publications.
Gabbay D., Martelli A., Giordano L., Olivetti N. Conditional logic programming 1993, MIT Press, technical report, University of Turin.
Gabbay D.M., Hunter A. Inconsistency Respectable, part I 1991, 19-32. Springer Verlag, Vol 535 of LNAI. P. Jorrand, J. Kelement (Eds.).
Gabbay D.M., Hunter A. Making Inconsistency Respectable, part II 1993, 129-136. Springer Verlag, Vol 747 of LNC. M. Clarke, R. Kruse, S. Moral (Eds.).
Gabbay D., Marcelino S. Modal logics of reactive frames. Studia Logica 2009, 93:403-444.
Gabbay D., Olivetti N. Goal Directed Algorithmic Proof Theory 2000, 266. Kluwer Academic Publishers.
Gabbay D., Reyle U. Direct deductive computation on discourse representation structures. Linguisitics and Philosophy 1994, 17:345-390. Technical report, University of Stuttgart, 1988.
Gabbay D., Rodrigues O. Voting and Fuzzy Argumentation Networks 2012, submitted to Journal of Approximate Reasoning. Short version to appear in, Springer, New revised version now entitled: Equilibrium States on Numerical Argumentation Networks.
Gabbay D.M., Woods J. The new logic. Logic Journal of the IGPL 2001, 9(2):141-174.
Gabbay D.M., Woods J. The law of evidence and labelled deductive systems. Phi-News 2003, 4:5-46. October, Also Chapter 15 in D. M. Gabbay et al., eds Approaches to legal Rationality, Logic, Episemology and the Unity of Science 20, pp. 295-331, Springer, 2010. http://phinews.ruc.dk/phinews4.pdf.
Gabbay D., Woods J. Resource Origins of Non-Monotonicity. Studia Logica 2008, Vol 88:85-112.
Hunter A. Base Logics in Argumentation 2010, 275-286.
Kowalski R.A. Logic for Problem Solving 1979, North-Holland.
Kraus S., Lehmann D., Magidor M. Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence 1990, 44:167-207.
Lehman D., Magidor M. What does a conditional knowledge base entail?. Artificial Intelligence 1992, 55:1-60.
Makinson D. General theory of cumulative inference. Non-monotonic Reasoning 1989, 1-18. Springer-Verlag, Berlin, Volume 346 of Lecture Notes in Artificial Intelligence. M. Reinfrank (Ed.).
Makinson D., van der Torre L. Input/output logics. Journal of Philosophial Logic 2000, 29(4):383-408.
Makinson D., van der Torre L. Constraints for input/output logics. Jouranl of Philosophical Logic 2001, 3(2):155-185.
Makinson D., van der Torre L. What is input/output logic?. ESSLLI 2001.
Metcalfe G., Olivetti N., Gabbay D. Proof theory for Fuzzy Logics 2008, Springer, (Monograph).
Nute D., Cross C. Conditional Logic. Handbook of Philosophical Logic 2002, 1-98. Kluwer, Volume 4. 2nd edition. D. Gabbay, F. Guenthner (Eds.).
Parent X., Gabbay D., van der Torre L. Intuitionistic basis for input/output logic. David Makinson on Classical Methods to Non-Classical Problems 2014, 263-286. Springer. S.O. Hansson (Ed.).
Rohde P. Moving in a crumbling network: the balanced case. CSL 2004, 1-25. Springer, LNCS. J. Marcinkowski, A. tarlecki (Eds.).
Schröder E. Vorlesungen über die Algebra die Logik 1890-1914, B. G. Tuebner, Leipzig, 3 vols Reprints, Chelsea, 1996, Thoemmes Press, 2000.
Scott D. Completeness and axiomatizability in many-valued logics. Proceedings of the Tarski Symposium 1974, 411-436. American Mathematical Society, Providence, Rhode Island.
Shapiro S. Varieties of Logic 2014, OUP.
Sheeran M., Stalmarck G. A tutorial on Stalmarck's proof procedure for propositional logic. Formal Methods in System Design 2000, 16:23-58.
Tarski A. On the concept of logical consequence. Logic, Semantics, Metamathematics 1936, Oxford University Press.
The Nature of Logic 1999, Volume 4. CSLI Publications, European Review of Philosophy. A.C. Varzi (Ed.).
http://en.wikipedia.org/wiki/T-norm.
Wójcicki R. Theory of Logical Calculi 1988, Reidel, Doredrecht.
Wójcicki R. An axiomatic treatment of non-monotonic arguments. Bulletin of the Section of Logic 1988, 17(2):56-61.
