The guarded fragment: Ins and outs

In this short note we discuss several perspectives on the notion of Guarded Fragments (GFs) of first-order logic first introduced by Andreka, van Benthem and Nemeti. We focus on computational aspects, discussing some applications of GFs together with issues like the design of effective decision methods for specific reasoning tasks and the role of GFs in explaining the general good behavior of modal logics.

[1]  Igor Walukiewicz,et al.  Guarded fixed point logic , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[2]  Erich Grädel.  Description Logics and Guarded Fragments of First Order Logic , 1998, Description Logics.

[3]  Erich Grädel,et al.  On the Restraining Power of Guards , 1999, Journal of Symbolic Logic.

[4]  Werner Nutt,et al.  Proceedings of the 1998 International Workshop on Description Logics (DL'98), IRST, Povo - Trento, Italy, June 6-8, 1998 , 1998, Description Logics.

[5]  Francesco M. Donini,et al.  Reasoning in description logics , 1997 .

[6]  Robert Givan,et al.  Natural Language Syntax and First-Order Inference , 1992, Artificial Intelligence.

[7]  Michael Mortimer,et al.  On languages with two variables , 1975, Math. Log. Q..

[8]  M. de Rijke.  Modal logics and Description logics , 1998 .

[9]  Fausto Giunchiglia,et al.  Building Decision Procedures for Modal Logics from Propositional Decision Procedures: The Case Study of Modal K(m) , 2000, Inf. Comput..

[10]  Margus Veanes,et al.  The two-variable guarded fragment with transitive relations , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[11]  Christoph Weidenbach,et al.  SPASS & FLOTTER Version 0.42 , 1996, CADE.

[12]  Umberto Straccia,et al.  A model of information retrieval based on a terminological logic , 1993, SIGIR.

[13]  Martin Otto,et al.  On Logics with Two Variables , 1999, Theor. Comput. Sci..

[14]  Dov M. Gabbay,et al.  EXPRESSIVE FUNCTIONAL COMPLETENESS IN TENSE LOGIC , 1981 .

[15]  Uwe Küssner.  Description Logic Unplugged , 1998, Description Logics.

[16]  Fabrizio Sebastiani,et al.  Trends in ... a Critical Review: On the Role of Logic in Information Retrieval , 1998, Inf. Process. Manag..

[17]  Yuri Gurevich,et al.  The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.

[18]  Maarten Marx,et al.  Interpolation in Guarded Fragments , 2000 .

[19]  Maarten de Rijke,et al.  Description Logics and Feature Interaction , 1999, Description Logics.

[20]  Volker Haarslev,et al.  SEMANTICS-BASED INFORMATION RETRIEVAL , 1998 .

[21]  J. Benthem.  DYNAMIC BITS AND PIECES , 1997 .

[22]  Edith Hemaspaandra.  Complexity transfer for modal logic , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[23]  Harald Ganzinger,et al.  A superposition decision procedure for the guarded fragment with equality , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[24]  T. Tammet.  10th international conference on automated deduction , 1991 .

[25]  Wilhelm Ackermann,et al.  Solvable Cases Of The Decision Problem , 1954 .

[26]  J.F.A.K. van Benthem,et al.  Modal logic and classical logic , 1983 .

[27]  Moshe Y. Vardi.  Why is Modal Logic So Robustly Decidable? , 1996, Descriptive Complexity and Finite Models.

[28]  Alexander Dekhtyar,et al.  Information Retrieval , 2018, Lecture Notes in Computer Science.

[29]  Johan van Benthem,et al.  Modal Languages and Bounded Fragments of Predicate Logic , 1998, J. Philos. Log..

[30]  Dov M. Gabbay,et al.  Fibring Semantic Tableaux , 1998, TABLEAUX.