Some (in)translatability results for normal logic programs and propositional theories

Journal of Applied Non-Classical Logics

Volumn 16, Issue 1-2, 2006, Pages 35-86

  Janhunen, Tomi ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Answer set programming; Expressive power; Modularity; Satisfiability solvers; Stable model semantics; Translation functions

Indexed keywords

EID: 38049070839     PISSN: 11663081     EISSN: 19585780     Source Type: Journal    
DOI: 10.3166/jancl.16.35-86     Document Type: Article

References (62)

1. [Ant 01] Antoniou G., Billington D., Governatori G., Maher M. J., "Representation Results For Defeasible Logic", Acm Transactions On Computational Logic, Vol. 2, Num. 2, 2001, P. 255-287.
2. [Apt 88] Apt K., Blair H., Walker A., "Towards A Theory Of Declarative Knowledge", Minker J., Ed., Foundations Of Deductive Databases And Logic Programming, P. 89-148, Morgan Kaufmann, Los Altos, 1988.
3. [Ara 95] Aravindan C., Dung P. M., "On The Correctness Of Unfold/Fold Transformation Of Normal And Extended Logic Programs", Journal Of Logic Programming, Vol. 24, Num. 3, 1995, P. 201-217.
4. [Bab 00] Babovich Y., Erdem E., Lifschitz V., "Fages' Theorem And Answer Set Programming", Proceedings Of The 8Th International Workshop On Non-Monotonic Reasoning, Breckenridge, Colorado, Usa, April 2000, Cs.Ai/0003042.
5. [Bay 97] Bayardo R., Schrag R., "Using Csp Look-Back Techniques To Solve Real-World Sat Instances", Proceedings Of The 12Th National Conference, Aaai, 1997, P. 203-208.
6. [Ben 94] Ben-Eliyahu R., Dechter R., "Propositional Semantics For Disjunctive Logic Programs", Annals Of Mathematics And Artificial Intelligence, Vol. 12, Num. 1-2, 1994, P. 53-87.
7. [Bra 97] Brass S., Dix J., "Characterizations Of The Disjunctive Stable Semantics By Partial Evaluation", Journal Of Logic Programming, Vol. 32, Num. 3, 1997, P. 207-228.
8. [Bug 94] Bugliesi M., Lamma E., Mello P., "Modularity In Logic Programming", Journal Of Logic Programming, Vol. 19-20, 1994, P. 443-502.
9. [Cab 05] Cabalar P., Ferraris P., "Propositional Theories Are Strongly Equivalent To Logic Programs", Submitted For Publication, 2005.
10. [Cla 78] Clark K. L., "Negation As Failure", Gallaire H., Minker J., Eds., Logic And Data Bases, P. 293-322, Plenum Press, New York, 1978.
11. [Coo 71] Cook S. A., "The Complexity Of Theorem Proving Procedures", Proceedings Of The Third Annual Acm Symposium On Theory Of Computing, 1971, P. 151-158.
12. [Cos 02] Costantini S., D'antona O., Provetti A., "On The Equivalence And Range Of Applicability Of Graph-Based Representations Of Logic Programs", Information Processing Letters, Vol. 84, 2002, P. 241-249. (Pubitemid 35167766)
13. [Dim 97] Dimopoulos Y., Nebel B., Koehler J., "Encoding Planning Problems In Nonmonotonic Logic Programs", Proceedings Of The Fourth European Conference On Planning, Toulouse, France, September 1997, Springer-Verlag, P. 169-181.
14. [Dow 84] Dowling W. F., Gallier J. H., "Linear-Time Algorithms For Testing The Satisfiability Of Propositional Horn Formulae", Journal Of Logic Programming, Vol. 3, 1984, P. 267-284.
15. [Eit 98] Eiter T., Leone N., Mateis C., Pfeifer G., Scarcello F., "The Kr System Dlv: Progress Report, Comparisons And Benchmarks", Proceedings Of The 6Th International Conference On Principles Of Knowledge Representation And Reasoning, Trento, Italy, June 1998, Morgan Kaufmann, P. 406-417.
16. [Eit 04] Eiter T., Fink M., Tompits H., Woltran S., "Simplifying Logic Programs Under Uniform And Strong Equivalence", Proceedings Of Lpnmr-7, Fort Lauderdale, Florida, January 2004, Springer, P. 87-99, Lnai 2923.
17. [Emd 76] Van Emden M., Kowalski R., "The Semantics Of Predicate Logic As A Programming Language", Journal Of The Acm, Vol. 23, 1976, P. 733-742.
18. [Erd 01] Erdem E., Lifschitz V., "Transitive Closure, Answer Sets And Predicate Completion", Aaai Spring Symposium On Answer Set Programming: Towards Efficient And Scalable Knowledge Representation And Reasoning, Aaai, 2001.
19. [Erd 03] Erdem E., Lifschitz V., "Tight Logic Programs", Theory And Practice Of Logic Programming, Vol. 3, Num. 4-5, 2003, P. 499-518.
20. [Eta 96] Etalle S., Gabbrielli M., "Transformations Of Clp Modules", Theoretical Computer Science, Vol. 166, 1996, P. 101-146. (Pubitemid 126412025)
21. [Fag 94] Fages F., "Consistency Of Clark's Completion And Existence Of Stable Models", Journal Of Methods Of Logic In Computer Science, Vol. 1, 1994, P. 51-60.
22. [Fer 05] Ferraris P., "On Modular Translations And Strong Equivalence", Baral C., Greco G., Leone N., Terracina G., Eds., Proceedings Of The 8Th International Conference On Logic Programming And Nonmonotonic Reasoning, Diamante, Italy, September 2005, Springer-Verlag, P. 79-91.
23. [Gel 88] Gelfond M., Lifschitz V., "The Stable Model Semantics For Logic Programming", Proceedings Of The 5Th International Conference On Logic Programming, Seattle, Usa, August 1988, The Mit Press, P. 1070-1080.
24. [Gel 90] Gelfond M., Lifschitz V., "Logic Programs With Classical Negation", Proceedings Of The 7Th International Conference On Logic Programming, Jerusalem, Israel, June 1990, The Mit Press, P. 579-597.
25. [Gel 91] Gelfond M., Lifschitz V., "Classical Negation In Logic Programs And Disjunctive Databases", New Generation Computing, Vol. 9, 1991, P. 365-385.
26. [Gel 02] Gelfond M., Leone N., "Logic Programming And Knowledge Representation-The A-Prolog Perspective", Artificial Intelligence, Vol. 138, 2002, P. 3-38.
27. [Got 95] Gottlob G., "Translating Default Logic Into Standard Autoepistemic Logic", Journal Of The Acm, Vol. 42, Num. 2, 1995, P. 711-740.
28. [Imi 87] Imielinski T., "Results On Translating Defaults To Circumscription", Artificial Intelligence, Vol. 32, 1987, P. 131-146.
29. [Jan 99A] Janhunen T., "Classifying Semi-Normal Default Logic On The Basis Of Its Expressive Power", Gelfond M., Leone N., Pfeifer G., Eds., Proceedings Of The 5Th International Conference On Logic Programming And Non-Monotonic Reasoning, Lpnmr'99, El Paso, Texas, December 1999, Springer-Verlag, P. 19-33, Lnai 1730.
30. [Jan 99B] Janhunen T., "On The Intertranslatability Of Non-Monotonic Logics", Annals Of Mathematics And Artificial Intelligence, Vol. 27, Num. 1-4, 1999, P. 79-128.
31. [Jan 00A] Janhunen T., "Capturing Stationary And Regular Extensions With Reiter's Extensions", Ojeda-Aciego M. Et Al., Eds., Logics In Artificial Intelligence, European Workshop, Jelia 2000, MáLaga, Spain, September/October 2000, Springer-Verlag, P. 102-117, Lnai 1919.
32. [Jan 00B] Janhunen T., "Comparing The Expressive Powers Of Some Syntactically Restricted Classes Of Logic Programs", Lloyd J. Et Al., Eds., Computational Logic, First International Conference, London, Uk, July 2000, Springer-Verlag, P. 852-866, Lnai 1861.
33. [Jan 01] Janhunen T., "On The Effect Of Default Negation On The Expressiveness Of Disjunctive Rules", Eiter T., Faber W., Truszczy'nski M., Eds., Logic Programming And Nonmonotonic Reasoning, Proceedings Of The 6Th International Conference, Vienna, Austria, September 2001, Springer-Verlag, P. 93-106, Lnai 2173. (Pubitemid 33347399)
34. [Jan 02] Janhunen T., Oikarinen E., "Testing The Equivalence Of Logic Programs Under Stable Model Semantics", Flesca S. Et Al., Eds., Logics In Artificial Intelligence, Pro-Ceedings Of The 8Th European Conference, Cosenza, Italy, September 2002, Springer-Verlag, P. 493-504, Lnai 2424.
35. [Jan 03A] Janhunen T., "Evaluating The Effect Of Semi-Normality On The Expressiveness Of Defaults", Artificial Intelligence, Vol. 144, Num. 1-2, 2003, P. 233-250.
36. [Jan 03B] Janhunen T., "Translatability And Intranslatability Results For Certain Classes Of Logic Programs", Series A: Research Report Num. 82, November 2003, Helsinki University Of Technology, Laboratory For Theoretical Computer Science, Espoo, Finland.
37. [Jan 04] Janhunen T., "Representing Normal Programs With Clauses", De Mántaras R. L., Saitta L., Eds., Proceedings Of The 16Th European Conference On Artificial Intelligence, Valencia, Spain, August 2004, Ios Press, P. 358-362.
38. [Kau 96] Kautz H., Selman B., "Pushing The Envelope: Planning, Propositional Logic, And Stochastic Search", Proceedings Of The 13Th National Conference On Artificial Intelligence, Portland, Oregon, July 1996.
39. [Lie 04] Lierler Y., Maratea M., "Cmodels-2: Sat-Based Answer Set Solver Enhanced To Non-Tight Programs", Proceedings Of Lpnmr-7, Fort Lauderdale, Florida, January 2004, Springer, P. 346-350, Lnai 2923. (Pubitemid 38050692)
40. [Lif 01] Lifschitz V., Pearce D., Valverde A., "Strongly Equivalent Logic Programs", Acm Transactions On Computational Logic, Vol. 2, 2001, P. 526-541.
41. [Lif 06] Lifschitz V., Razborov A., "Why Are There So Many Loop Formulas?", Acm Transactions On Computational Logic, Vol. 7, Num. 2, 2006, To Appear, See http://www. Acm.Org/Pubs/Tocl/Accepted.html.
42. [Lin 03] Lin F., Zhao J., "On Tight Logic Programs And Yet Another Translation From Normal Logic Programs To Propositional Logic", Gottlob G., Walsh T., Eds., The 18Th International Joint Conference On Artificial Intelligence, Acapulco, Mexico, August 2003, Morgan Kaufmann, P. 853-858.
43. [Lin 04] Lin F., Zhao Y., "Assat: Computing Answer Sets Of A Logic Program By Sat Solvers", Artificial Intelligence, Vol. 157, 2004, P. 115-137.
44. [Llo 87] Lloyd J., Foundations Of Logic Programming, Springer-Verlag, Berlin, 1987.
45. [Mah 88] Maher M. J., "Equivalences Of Logic Programs", Minker J., Ed., Foundations Of Deductive Databases And Logic Programming, P. 627-658, Morgan Kaufmann, Los Altos, 1988.
46. [Mah 93] Maher M. J., "A Tranformation System For Deductive Databases Modules With Perfectmodel Semantics", Theoretical Computer Science, Vol. 110, Num. 2, 1993, P. 377-403.
47. [Mar 91] Marek W., Truszczýnski M., "Autoepistemic Logic", Journal Of The Acm, Vol. 38, 1991, P. 588-619.
48. [Mar 92] Marek V. W., Subrahmanian V. S., "The Relationship Between Stable, Supported, Default And Autoepistemic Semantics For General Logic Programs", Theoretical Computer Science, Vol. 103, 1992, P. 365-386.
49. [Mar 99] Marek W., Truszczy'n Ski M., "Stable Models And An Alternative Logic Programming Paradigm", The Logic Programming Paradigm: A 25-Year Perspective, P. 375-398, Springer-Verlag, 1999.
50. [Mos 01] Moskewicz M., Madigan C., Zhao Y., Zhang L., Malik S., "Chaff: Engineering An Efficient Sat Solver", Proceedings Of The 39Th Design Automation Conference, Las Vegas, 2001.
51. [Nie 99] Niemelä; I., "Logic Programs With Stable Model Semantics As A Constraint Programming Paradigm", Annals Of Mathematics And Artificial Intelligence, Vol. 25, Num. 3-4, 1999, P. 241-273.
52. [Nut 94] Nute D., "Defeasible Logic", Gabbay D., Hogger C., Robinson J., Eds., Handbook Of Logic In Artificial Intelligence And Logic Programming, Chapter 7, P. 353-395, Oxford Science Publications, 1994.
53. [Pet 94] Pettorossi A., Proietti M., "Transformation Of Logic Programs: Foundations And Techniques", Journal Of Logic Programming, Vol. 19-20, 1994, P. 261-320.
54. [Rei 78] Reiter R., "On Closed World Data Bases", Gallaire H., Minker J., Eds., Logic And Data Bases, P. 55-76, Plenum Press, New York, 1978.
55. [Rob 65] Robinson J. A., "A Machine-Oriented Logic Based On The Resolution Principle", Journal Of The Acm, Vol. 12, Num. 1, 1965, P. 23-41.
56. [Sch 95] Schlipf J., "The Expressive Powers Of The Logic Programming Semantics", Journal Of Computer And System Sciences, Vol. 51, 1995, P. 64-86.
57. [Sim 02] Simons P., Niemelä; I., Soininen T., "Extending And Implementing The Stable Model Semantics", Artificial Intelligence, Vol. 138, Num. 1-2, 2002, P. 181-234.
58. [Sub 95] Subrahmanian V., Nau D., Vago C., "Wfs + Branch And Bound = Stable Models", Ieee Transactions On Knowledge And Data Engineering, Vol. 7, Num. 3, 1995, P. 362-377.
59. [Tse 83] Tseitin G. S., "On The Complexity Of Derivation In Propositional Calculus", Siekmann J., Wrightson G., Eds., Automation Of Reasoning 2: Classical Papers On Computational Logic 1967-1970, P. 466-483, Springer, Berlin, Heidelberg, 1983.
60. [Tur 03] Turner H., "Strong Equivalencemade Easy: Nested Expressions Andweight Constraints", Theory And Practice Of Logic Programming, Vol. 3, Num. 4-5, 2003, P. 609-622.
61. [Van 91] Van Gelder A., Ross K., Schlipf J., "Thewell-Founded Semantics For General Logic Programs", Journal Of The Acm, Vol. 38, Num. 3, 1991, P. 620-650.
62. [Wol 04] Woltran S., "Characterizations For Relativized Notions Of Equivalence In Answer Set Programming", Alferes J., Leite J., Eds., Logics In Artificial Intelligence: 9Th European Conference, Springer Verlag, September 2004, P. 161-173, Lnai 3229. (Pubitemid 41049933)