Open answer set programming with guarded programs

ACM Transactions on Computational Logic

Volumn 9, Issue 4, 2008, Pages

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

^a UNIVERSITY OF INNSBRUCK   (Austria)

^b VRIJE UNIVERSITEIT BRUSSEL   (Belgium)

Author keywords

Answer set programming; Fixed point logic; Open domains

Indexed keywords

ANSWER SET PROGRAMMING; FIXED-POINT LOGIC; FIXED-POINT LOGICS; OPEN DOMAINS;

BOOLEAN FUNCTIONS; INFORMATION THEORY; SATELLITE NAVIGATION AIDS; SEMANTICS; SYNTACTICS; TRANSLATION (LANGUAGES);

PROGRAM TRANSLATORS;

EID: 51149116102     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/1380572.1380575     Document Type: Article

References (50)

1. ABITEBOUL, S., HULL, R., AND VIANU, V. 1995. Foundations of Databases. Addison-Wesley, Reading, MA.
2. ANDRÉKA, H., NÉMETI, I., AND VAN BENTHEM, J. 1998. Modal languages and bounded fragments of predicate logic. J. Philosoph. Log. 27, 3, 217-274.
3. ATTIE, P. C. AND EMERSON, E. A. 2001. Synthesis of concurrent programs for an atomic read/write model of computation. ACM Trans. Program. Lang. Syst. 23, 2, 187-242.
4. BALDUCCINI, M. AND GELFOND, M. 2003. Diagnostic reasoning with a-prolog. Theor. Pract. Log. Program. 3, 4-5, 425-461.
5. BARAL, C. 2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge, U.K.
6. CHANDRA, A. K. AND HAREL, D. 1982. Horn clauses and the fixpoint query hierarchy. In Proceedings of PODS '82. ACM Press, New York, NY, 158-163.
7. CLARK, K. L. 1987. Negation as failure. In Readings in Nonmonotonic Reasoning. Morgan Kaufmann, San Francisco, CA, 311-325.
8. CLARKE, E. M., EMERSON, E. A., AND SISTLA, A. P. 1986. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. Program. Lang. Syst. 8, 2, 244-263.
9. DANTSIN, E., EITER, T., GOTTLOB, G., AND VORONKOV, A. 2001. Complexity and expressive power of logic programming. ACM Comput. Surv. 33, 3, 374-425.
10. EMERSON, E. A. 1990. Temporal and modal logic. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Elsevier Science Publishers B.V., Amsterdam, The Netherlands, 995-1072.
11. EMERSON, E. A. AND CLARKE, E. M. 1982. Using branching time temporal logic to synthesize synchronization skeletons. Sci. Comput. Program. 2, 3, 241-266.
12. EMERSON, E. A. AND HALPERN, J. Y. 1982. Decision procedures and Expressiveness in the temporal logic of branching time. In Proceedings of the 14th Annual ACM Symposium on Theory of Computing. ACM Press, New York, NY, 169-180.
13. FLUM, J. 1999. On the (infinite) model theory of fixed-point logics. Models, Algebras, and Proofs, X. Caceido and C. Montenegro, Eds. Marcel Dekker, New York, NY, 67-75.
14. GELFOND, M. AND LIFSCHITZ, V. 1988. The stable model semantics for logic programming. In Proceedings of International Conference on Logic Programming (ICLP 1988). MIT Press, Cambridge, MA, 1070-1080.
15. GELFOND, M. AND PRZYMUSINSKA, H. 1993. Reasoning in open domains. In Logic Programming and Non-Monotonic Reasoning. MIT Press, Cambridge, MA, 397-413.
16. GOTTLOB, G., GRÄDEL, E., AND VEITH, H. 2002. Datalog LITE: A deductive query language with linear time model checking. ACM Trans. Computat. Log. 3, 1, 1-35.
17. GRÄDEL, E. 1999. On the restraining power of guards. J. Symbol. Log. 64, 4, 1719-1742.
18. GRÄDEL, E. 2002a. Guarded fixed point logic and the monadic theory of trees. Theoret. Comput. Sci. 288, 129-152.
19. GRÄDEL, E. 2002b. Model checking games. In Proceedings of WOLLIC 02. Electronic Notes in Theoretical Computer Science, vol. 67. Elsevier, Amsterdam, The Netherlands.
20. GRÄDEL, E., HIRSCH, C., AND OTTO, M. 2002b. Back and forth between guarded and modal logics. ACM Trans. Computat. Log. 3, 418-463.
21. GRÄDEL, E. AND WALUKIEWICZ, I. 1999. Guarded fixed point logic. In Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science (LICS '99). IEEE Computer Society Press, Los Alamitos, CA, 45-54.
22. HALEVY, A., MUMICK, I., SAGIV, Y., AND SHMUELI, O. 2001. Static analysis in Datalog extensions. J. ACM 48, 5, 971-1012.
23. HALPIN, T. 2001. Information Modeling and Relational Databases. Morgan Kaufmann, San Francisco, CA.
24. HEYMANS, S., VAN NIEUWENBORGH, D., AND VERMEIR, D. 2005a. Guarded open answer set programming. In 8th International Conference on Logic Programming and Non Monotonic Reasoning (LPNMR 2005), C. Baral, G. Greco, N. Leone, and G. Terracina, Eds. Lecture Notes in Artificial Intelligence, vol. 3662. Springer, Berlin, Germany, 92-104.
25. HEYMANS, S., VAN NIEUWENBORGH, D., AND VERMEIR, D. 2005b. Nonmonotonic ontological and rule-based reasoning with extended conceptual logic programs. In 2nd European Semantic Web Conference (ESWC 2005), A. Goméz-Pérez and J. Euzenat, Eds. Lecture Notes in Computer Science, vol. 3532. Springer, Berlin, Germany, 392-407.
26. HEYMANS, S., VAN NIEUWENBORGH, D., AND VERMEIR, D. 2006a. Guarded open answer set programming with generalized literals. In Fourth International Symposium on Foundations of Information and Knowledge Systems (FoIKS 2006), J. Dix and S. Hegner, Eds. Lecture Notes in Computer Science, vol. 3861. Springer, Berlin, Germany, 179-200.
27. HEYMANS, S., VAN NIEUWENBORGH, D., AND VERMEIR, D. 2006b. Open answer set programming for the semantic Web. J. Appl. Log.. To appear. Also available online at http://tinf2.vub.ac.be/∼sheymans/tech/hvnv-jal2006.pdf.
28. HUTH, M. R. A. AND RYAN, M. 2000. Logic in Computer Science: Modelling and Reasoning About Systems. Cambridge University Press, Cambridge, U.K.
29. IMMERMAN, N. 1986. Relational queries computable in polynomial time. Inform. Control 68, 1-3, 86-104.
30. KOZEN, D. 1983. Results on the Propositional μ-calculus. Theoret. Comput. Sci. 27, 333-354.
31. LEE, J. AND LIFSCHITZ, V. 2003. Loop formulas for disjunctive logic programs. In Proceedings of ICLP 2003. Lecture Notes in Computer Science, vol. 2916. Springer, Berlin, Germany, 451-465.
32. LEONE, N. AND PERRI, S. 2003. Parametric connectives in disjunctive logic programming. In Answer Set Programming. CEUR Workshop Proceedings, vol. 78. Available online at http://sunsite. informatile.rwth-aachen.de/Publications/CEUR-WS/.
33. LIFSCHITZ, V., PEARCE, D., AND VALVERDE, A. 2001a. Strongly Equivalent Logic Programs. ACM Trans. Computat. Log. 2, 4, 526-541.
34. LIFSCHITZ, V., PEARCE, D., AND VALVERDE, A. 2001b. Strongly equivalent logic programs. ACM Trans. Computat. Log. 2, 4, 526-541.
35. LIFSCHITZ, V., TANG, L. R., AND TURNER, H. 1999. Nested expressions in logic programs. Ann. Math. Artific. Intell. 25, 3-4, 369-389.
36. LIN, F. AND ZHAO, Y. 2002. ASSAT: Computing answer sets of a logic program by SAT solvers. In Proceedings of the 18th National Conference on Artificial Intelligence. 112-117.
37. LLOYD, J. AND TOPOR, R. 1984. Making Prolog more expressive. J. Log. Program. 1, 3, 225-240.
38. MANNA, Z. AND WOLPER, P. 1984. Synthesis of communicating processes from temporal logic specifications. ACM Trans. Program. Lang. Syst. 6, 1, 68-93.
39. MOSCHOVAKIS,Y. 1974. Elementary Induction on Abstract Structures. North Holland, Amsterdam, The Netherlands.
40. OSORIO, M., NAVARRO, J. A., AND ARRAZOLA, J. 2004. Applications of intuitionistic logic in answer set programming. Theor. Pract. Log. Program. 4, 3, 325-354.
41. OSORIO, M. AND ORTIZ, M. 2004. Embedded implications and minimality in asp. In Proceedings of the 15th International Conference on Applications of Declarative Programming and Knowledge Management and 18th Workshop on Logic Programming. 241-254.
42. PAPADIMITRIOU, C. H. 1994. Computational Complexity. Addison Wesley, Reading, MA.
43. SCHLIPF, J. 1993. Some Remarks on Computability and Open Domain Semantics. In Proceedings of the Workshop on Structural Complexity and Recursion-Theoretic Methods in Logic Programming.
44. SCHLIPF, J. 1995. Complexity and undecidability results for logic programming. Ann. Math. Ar-tific. Intell. 15, 3-4, 257-288.
45. SISTLA, A. P. AND CLARKE, E. M. 1985. The complexity of propositional linear temporal logics. J. ACM 32, 3, 733-749.
46. SYRJÄNEN, T. 2004. Cardinality constraint programs. In Proceedings of JELIA'04. Springer, Berlin, Germany, 187-200.
47. TARSKI, A. 1955. A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math. 5, 285-309.
48. TOBIES, S. 2001. Complexity results and practical algorithms for logics in knowledge representation. Ph.D. dissertation, LuFG Theoretical Computer Science, RWTH-Aachen, Germany.
49. VAN BENTHEM, J. 1997. Dynamic bits and pieces. In ILLC Research Report. University of Amsterdam, Amsterdam, The Netherlands.
50. vAN EMDEN, M. H. AND KOWALSKI, R. A. 1976. The semantics of predicate logic as a programming language. J. ACM 23, 4, 733-742.