Guarded open answer set programming with generalized literals

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3861 LNCS, Issue , 2006, Pages 179-200

  Heymans, Stijn ^a   Van Nieuwenborgh, Davy ^a   Vermeir, Dirk ^a  

^a VRIJE UNIVERSITEIT BRUSSEL   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DECISION MAKING; FORMAL LOGIC; LOGIC PROGRAMMING; MATHEMATICAL MODELS; SEMANTICS; SET THEORY; SYNTACTICS; TREES (MATHEMATICS);

DATALOG; EXTENDED PROGRAMS (EP); FIXED POINT LOGIC; SET PROGRAMMING;

COMPUTER PROGRAMMING;

EID: 33745669459     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11663881_11     Document Type: Conference Paper

References (20)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. J. Van Benthem. Dynamic Bits and Pieces. In ILLC research report. University of Amsterdam, 1997.
3. A. K. Chandra and D. Harel. Horn Clauses and the Fixpoint Query Hierarchy. In Proc. of PODS '82, pages 158-163. ACM Press, 1982.
4. E. A. Emerson. Temporal and Modal Logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 995-1072. Elsevier Science Publishers B.V., 1990.
5. E. A. Emerson and E. M. Clarke. Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons. Sciene of Computer Programming, 2(3):241-266, 1982.
6. M. Gelfond and V. Lifschitz. The Stable Model Semantics for Logic Programming. In Proc. of ICLP'88, pages 1070-1080, Cambridge, Massachusetts, 1988. MIT Press.
7. M. Gelfond and H. Przymusinska. Reasoning in Open Domains. In Logic Programming and Non-Monotonic Reasoning, pages 397-413. MIT Press, 1993.
8. G. Gottlob, E. Grädel, and H. Veith. Datalog LITE: A deductive query language with linear time model checking. ACM Transactions on Computational Logic, 3(1):1-35, 2002.
9. E. Grädel. Guarded Fixed Point Logic and the Monadic Theory of Trees. Theoretical Computer Science, 288:129-152, 2002.
10. E. Grädel. Model Checking Games. In Proceedings of WOLLIC02, volume 67 of Electronic Notes in Theoretical Computer Science. Elsevier, 2002.
11. E. Grädel and I. Walukiewicz. Guarded Fixed Point Logic. In Proc. of LICS '99, pages 45-54. IEEE Computer Society, 1999.
12. A. Halevy, I. Mumick, Y. Sagiv, and O. Shmueli. Static Analysis in Datalog Extensions. Journal of the ACM, 48(5):971-1012, 2001.
13. S. Heymans, D. Van Nieuwenborgh, and D. Vermeir. Nonmonotonic Ontological and Rule-Based Reasoning with Extended Conceptual Logic Programs. In Proc. of ESWC 2005, number 3532 in LNCS, pages 392-407. Springer, 2005.
14. S. Heymans, D. Van Nieuwenborgh, and D. Vermeir. Guarded Open Answer Set Programming. In 8th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2005), number 3662 in LNAI, pages 92-104. Springer, 2005.
15. M. R. A. Huth and Mark Ryan. Logic in Computer Science: Modelling and Reasoning about Systems. Cambridge University Press, 2000.
16. V. Lifschitz, D. Pearce, and A. Valverde. Strongly Equivalent Logic Programs. ACM Transactions on Computational Logic, 2(4):526-541, 2001.
17. J. Lloyd and R. Topor. Making Prolog More Expressive. J. Log. Program., 1(3):225-240, 1984.
18. P.Simons. SMODELS homepage. http://www.tcs.hut.fi/Software/smodels/.
19. T. Syrjänen. Omega-restricted Logic Programs. In Proc. of LPNMR, volume 2173 of LNAI, pages 267-279. Springer, 2001.
20. T. Syrjänen. Cardinality Constraint Programs. In Proc. of JELIA'04, pages 187-200. Springer, 2004.