Guarded open answer set programming

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

Volumn 3662 LNAI, Issue , 2005, Pages 92-104

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

^a VRIJE UNIVERSITEIT BRUSSEL   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; MATHEMATICAL MODELS; SEMANTICS; SET THEORY;

ANSWER SET SEMANTICS; FIXED POINT LOGIC (FPL); OPEN ANSWER SET PROGRAMMING (OASP);

COMPUTER PROGRAMMING;

EID: 33646042244     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11546207_8     Document Type: Conference Paper

References (23)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. H. Andréka, I. Németi, and J. Van Benthem. Modal Languages and Bounded Fragments of Predicate Logic. J. of Philosophical Logic, 27(3):217-274, 1998.
3. C. Baral. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge Press, 2003.
4. J. Van Benthem. Dynamic Bits and Pieces. In ILLC research report. University of Amsterdam, 1997.
5. A. K. Chandra and D. Harel. Horn Clauses and the Fixpoint Query Hierarchy. In Proc. of PODS '82, pages 158-163. ACM Press, 1982.
6. K. L. Clark. Negation as Failure. In Readings in Nonmonotonic Reasoning, pages 311-325. Kaufmann, 1987.
7. E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov. Complexity and Expressive Power of Logic Programming. ACM Comput. Surv., 33(3):374-425, 2001.
8. 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.
9. W. Faber, N. Leone, and G. Pfeifer. Pushing Goal Derivation in DLP Computations. In Proc. of LPNMR, volume 1730 of LNCS, pages 177-191. Springer, 1999.
10. 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.
11. M. Gelfond and H. Przymusinska. Reasoning in Open Domains. In Logic Programming and Non-Monotonic Reasoning, pages 397-413. MIT Press, 1993.
12. 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.
13. E. Grädel. On the Restraining Power of Guards. Journal of Symbolic Logic, 64(4): 1719- 1742, 1999.
14. E. Grädel and I. Walukiewicz. Guarded Fixed Point Logic. In Proc. of LICS '99, pages 45-54. IEEE Computer Society, 1999.
15. S. Heymans, D. Van Nieuwenborgh, and D. Vermeir. Guarded Open Answer Set Programming. Technical report. http://tinf2.vub.ac.be/~sheymans/tech/guarded-oasp.ps.gz.
16. S. Heymans, D. Van Nieuwenborgh, and D. Vermeir. Semantic Web Reasoning with Conceptual Logic Programs. In Proc. of RuleML 2004, pages 113-127. Springer, 2004.
17. 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.
18. D. Kozen. Results on the Propositional μ-calculus. Theor. Comput. Sci., 27:333-354, 1983.
19. J. Lee and V. Lifschitz. Loop Formulas for Disjunctive Logic Programs. In Proc. of ICLP 2003, volume 2916 of LNCS, pages 451-465. Springer, 2003.
20. V. Lifschitz, D. Pearce, and A. Valverde. Strongly Equivalent Logic Programs. ACM Transactions on Computational Logic, 2(4): 526-541, 2001.
21. F. Lin and Y. Zhao. ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers. In Proc. of 18th National Conference on Artificial Intelligence, pages 112-117. AAAI, 2002.
22. T. Syrjänen. Omega-restricted Logic Programs. In Proc. of LPNMR, volume 2173 of LNAI, pages 267-279. Springer, 2001.
23. T. Syrjänen and I. Niemelä. The SMODELS System. In Proc. of LPNMR, volume 2173 of LNCS, pages 434-438. Springer, 2001.