Representing normal programs with clauses

Frontiers in Artificial Intelligence and Applications

Volumn 110, Issue , 2004, Pages 358-362

  Janhunen, Tomi ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER CIRCUITS; LOGIC PROGRAMMING; PROGRAM TRANSLATORS;

CLASSICAL MODELING; LOGIC PROGRAMS; PROPERTY; SAT SOLVERS; STABLE MODEL; TRANSLATION FUNCTIONS;

ATOMS;

EID: 85017337722     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (21)

1. K.R. Apt, H.A. Blair, and A. Walker, 'Towards a theory of declarative knowledge', in Foundations of Deductive Databases and Logic Programming, ed., J. Minker, 89-148, Morgan Kaufmann, Los Altos, (1988).
2. Y. Babovich, E. Erdem, and V. Lifschitz, 'Fages' theorem and answer set programming', in Proceedings of the 8th International Workshop on Non-Monotonic Reasoning, Breckenridge, Colorado, USA, (April 2000). cs.AI/0003042.
3. R.J. Bayardo and R. Schrag, 'Using CSP look-back techniques to solve real-world sat instances', in Proceedings of the 12th National Conference, pp. 203-208. AAAI, (1997).
4. R. Ben-Eliyahu and R. Dechter, 'Propositional semantics for disjunctive logic programs', Annals of Mathematics and Artificial Intelligence, 12(1-2), 53-87, (1994).
5. S. Brass and J. Dix, 'Semantics of (disjunctive) logic programs based on partial evaluation', Journal of Logic Programming, 38(3), 167-213, (1999).
6. Y. Dimopoulos, B. Nebel, and J. Koehler, 'Encoding planning problems in non-monotonic logic programs', in Proceedings of the 4th European Conference on Planning, pp. 169-181, Toulouse, France, (September 1997). Springer.
7. E. Erdem and V. Lifschitz, 'Tight logic programs', Theory and Practice of Logic Programming, 3(4-5), 499-518, (2003).
8. F. Fages, 'Consistency of Clark's completion and existence of stable models', Journal of Methods of Logic in Computer Science, 1, 51-60, (1994).
9. M. Gelfond and V. Lifschitz, 'The stable model semantics for logic programming', in Proceedings of the 5th International Conference on Logic Programming, pp. 1070-1080, Seattle, USA, (August 1988). MIT Press.
10. T. Janhunen, 'Comparing the expressive powers of some syntactically restricted classes of logic programs', in Computational Logic, First International Conference, eds., J. Lloyd et al., pp. 852-866, London, UK, (July 2000). Springer.
11. T. Janhunen, 'Translatability and intranslatability results for certain classes of logic programs', Series A: Research report 82, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, (2003).
12. H. Kautz and B. Selman, 'Pushing the envelope: Planning, propositional logic, and stochastic search', in Proceedings of the 13th National Conference on Artificial Intelligence, Portland, Oregon, (July 1996).
13. Y. Lierler and M. Maratea, 'Cmodels-2: Sat-based answer set solver enhanced to non-tight programs', in Proceedings of LPNMR-7, pp. 346-350, Fort Lauderdale, Florida, (January 2004). Springer. LNAI 2923.
14. F. Lin and J. Zhao, 'On tight logic programs and yet another translation from normal logic programs to propositional logic', in Proceedings of the 18th International Joint Conference on Artificial Intelligence, pp. 853-858, (2003).
15. F. Lin and Y. Zhao, 'ASSAT: Computing answer sets of a logic program by sat solvers', in Proceedings of the 18th National Conference on Artificial Intelligence, pp. 112-117, Edmonton, Alberta, Canada, (July/August 2002). AAAI.
16. J.W. Lloyd, Foundations of Logic Programming, Springer, Berlin, 1987.
17. V.W. Marek and V.S. Subrahmanian, 'The relationship between stable, supported, default and autoepistemic semantics for general logic programs', Theoretical Computer Science, 103, 365-386, (1992).
18. W. Marek and M. Truszczýnski, 'Stable models and an alternative logic programming paradigm', in The Logic Programming Paradigm: A 25-Year Perspective, Springer, (1999).
19. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik, 'Chaff: Engineering an efficient sat solver', in Proceedings of the 39th Design Automation Conference, Las Vegas, (2001).
20. I. Niemela, 'Logic programs with stable model semantics as a constraint programming paradigm', Annals of Mathematics and Artificial Intelligence, 25(3-4), 241-273, (1999).
21. P. Simons, I. Niemela, and T. Soininen, 'Extending and implementing the stable model semantics', Artificial Intelligence, 138(1-2), 181-234, (2002).