Decidability under the well-founded semantics

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

Volumn 4524 LNCS, Issue , 2007, Pages 269-278

  Cherchago, Natalia ^a   Hitzler, Pascal ^b   Hölldobler, Steffen ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; KNOWLEDGE BASED SYSTEMS; LOGIC PROGRAMMING; ONTOLOGY; SEMANTIC WEB;

CLOSED-WORLD REASONING; HYBRID SYSTEMS; QUERY-ANSWERING; WELL-FOUNDED SEMANTICS;

SEMANTICS;

EID: 38149114597     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72982-2_21     Document Type: Conference Paper

References (14)

1. Schlipf, J.S.: The expressive powers of the logic programming semantics. In: Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, Orlando, FL, USA, pp. 64-86. Academic Press, Inc. London (1995)
2. van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. Journal of the ACM 38(3), 620-650 (1991)
3. Kifer, M., Lausen, G., Wu, J.: Logical Foundations of Object-Oriented and FrameBased Languages. Journal of the ACM 42, 741-843 (1995)
4. Rao, P., Sagonas, K., Swift, T., Warren, D., Freire, J.: XSB: A System for Effciently Computing WFS. In: Logic Programming and Non-monotonic Reasoning, pp. 431-441 (1997)
5. Bonatti, P.A.: Reasoning with infinite stable models. Artificial Intelligence 156(1), 75-111 (2004)
6. Dix, J.: A classification theory of semantics of normal logic programs: II. Weak Properties. Fundamenta Informaticae 22(3), 257-288 (1995)
7. Hitzler, P., Wendt, M.: A uniform approach to logic programming semantics. Theory and Practice of Logic Programming 5(1-2), 123-159 (2005)
8. Apt, K.R., Bezem, M.: Acyclic programs. New Generation Computing 9(3-4), 335-365 (1991)
9. Apt, K., Pedreschi, D.: Reasoning about termination of pure prolog programs. Information and Computation 106, 109-157 (1993)
10. Hitzler, P., Seda, A.K.: Generalized Metrics and Uniquely Determined Logic Programs. Theoretical Computer Science 305(1-3), 187-219 (2003)
11. Hitzler, P., Seda, A.K.: Characterizations of classes of programs by three-valued operators. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol. 1730, pp. 357-371. Springer, Heidelberg (1999)
12. Apt, K.R., Blair, H.A., Walker, A.: Towards a theory of declarative knowledge. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 89-148. Morgan Kaufmann, Los Altos (1988)
13. Przymusinski, T.: On the declarative semantics of deductive databases and logic programs. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 193-216. Morgan Kaufmann, Los Altos (1988)
14. Chen, W., Swift, T., Warren, D.: Efficient Top-Down Computation of Queries under the Well-Founded Semantics. Journal of Logic Programming 24(3), 161-199 (1995)