On Programs with Linearly Ordered Multiple Preferences

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

Volumn 3132, Issue , 2004, Pages 180-194

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

^a VRIJE UNIVERSITEIT BRUSSEL   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING; RECONFIGURABLE HARDWARE; SEMANTICS;

ANSWER SET SEMANTICS; LINEAR HIERARCHIES; LOGIC PROGRAMS; MEMBERSHIP PROBLEM; POLYNOMIAL HIERARCHIES; PREFERENCE RELATION; STATED PREFERENCES; VIOLATION OF CONSTRAINTS;

COMPUTER CIRCUITS;

EID: 35048859254     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27775-0_13     Document Type: Article

References (32)

1. José Júlio Alferes and Luís Moniz Pereira. Updates plus preferences. In Ojeda-Aciego et al. [23], pages 345-360.
2. Marcelo Arenas, Leopoldo Bertossi, and Jan Chomicki. Specifying and querying database repairs using logic programs with exceptions. In Proceedings of the 4th International Conference on Flexible Query Answering Systems, pages 27-41, Warsaw, Octobre 2000. Springer-Verlag.
3. Chitta Baral. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge Press, 2003.
4. G. Brewka. Logic programming with ordered disjunction. In Proceedings of the 18th National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, pages 100-105, Edmonton, Canada, July 2002. AAAI Press.
5. Gerhard Brewka and Thomas Eiter. Preferred answer sets for extended logic programs. Artificial Intelligence, 109(1-2):297-356, April 1999.
6. Gerhard Brewka, Ilkka Niemela, and Tommi Syrjanen. Implementing ordered disjunction using answer set solvers for normal programs. In Flesca et al. [17], pages 444-455.
7. Francesco Buccafurri, Wolfgang Faber, and Nicola Leone. Disjunctive logic programs with inheritance. In Danny De Schreye, editor, Logic Programming: The 1999 International Conference, pages 79-93, Las Cruces, New Mexico, December 1999. MIT Press.
8. Francesco Buccafurri, Nicola Leone, and Pasquale Rullo. Strong and weak constraints in disjunctive datalog. In Proceedings of the 4th International Conference on Logic Programming (LPNMR '97), pages 2-17, 1997.
9. Francesco Buccafurri, Nicola Leone, and Pasquale Rullo. Disjunctive ordered logic: Semantics and expressiveness. In Anthony G. Cohn, Lenhard K. Schubert, and Stuart C. Shapiro, editors, Proceedings of the 6th International Conference on Principles of Knowledge Representation and Reasoning, pages 418-431, Trento, June 1998. Morgan Kaufmann.
10. Francesco Buccafurri, Nicola Leone, and Pasquale Rullo. Enhancing disjunctive datalog by constraints. Knowledge and Data Engineering, 12(5):845-860, 2000.
11. Marina De Vos and Dirk Vermeir. Choice Logic Programs and Nash Equilibria in Strategic Games. In Jörg Flum and Mario Rodriguez-Artalejo, editors, Computer Science Logic (CSL'99), volume 1683 of Lecture Notes in Computer Science, pages 266-276, Madrid, Spain, 1999. Springer Verslag.
12. Thomas Eiter, Wolfgang Faber, Nicola Leone, and Gerald Pfeifer. The diagnosis frontend of the dlv system. AI Communications, 12(1-2):99-111, 1999.
13. Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, and Axel Polleres. Planning under incomplete knowledge. In John W. Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Luís Moniz Pereira, Yehoshua Sagiv, and Peter J. Stuckey, editors, Proceedings of the First International Conference on Computational Logic (CL2000), volume 1861 of Lecture Notes in Computer Science, pages 807-821. Springer, 2000.
14. k planning system. In Flesca et al. [17], pages 541-544.
15. Thomas Eiter, Michael Fink, Giuliana Sabbatini, and Hans Tompits. Considerations on updates of logic programs. In Ojeda-Aciego et al. [23], pages 2-20.
16. Wolfgang Faber, Nicola Leone, and Gerald Pfeifer. Representing school timetabling in a disjunctive logic programming language. In Proceedings of the 13th Workshop on Logic Programming (WLP '98), 1998.
17. Sergio Flesca, Sergio Greco, Nicola Leone, and Giovambattista lanni, editors. Logic in Artificial Intelligence, volume 2424 of Lecture Notes in Artificial Intelligence, Cosenza, Italy, September 2002. Springer Verlag.
18. D. Gabbay, E. Laenens, and D. Vermeir. Credulous vs. Sceptical Semantics for Ordered Logic Programs. In J. Allen, R. Fikes, and E. Sandewall, editors, Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning, pages 208-217, Cambridge, Mass, 1991. Morgan Kaufmann.
19. Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In Robert A. Kowalski and Kenneth A. Bowen, editors, Logic Programming, Proceedings of the Fifth International Conference and Symposium, pages 1070-1080, Seattle, Washington, August 1988. The MIT Press.
20. Robert A. Kowalski and Fariba Sadri. Logic programs with exceptions. In David H. D. Warren and Peter Szeredi, editors, Proceedings of the 7th International Conference on Logic Programming, pages 598-613, Jerusalem, 1990. The MIT Press.
21. Els Laenens and Dirk Vermeir. A logical basis for object oriented programming. In Jan van Eijck, editor, European Workshop, JELIA 90, volume 478 of Lecture Notes in Artificial Intelligence, pages 317-332, Amsterdam, The Netherlands, September 1990. Springer Verlag.
22. Vladimir Lifschitz. Answer set programming and plan generation. Journal of Artificial Intelligence, 138(1-2):39-54, 2002.
23. Manual Ojeda-Aciego, Inma P. de Guzmán, Gerhard Brewka, and Luíz Moniz Pereira, editors. Logic in Artificial Intelligence, volume 1919 of Lecture Notes in Artificial Intelligence, Malaga, Spain, September-October 2000. Springer Verlag.
24. Christos H. Papadimitriou. Computational Complexity. Addison Wesley, 1994.
25. Raymond Reiter. A theory of diagnosis from first principles. Artificial Intelligence, 32(1):57-95, 1987.
26. Chiaki Sakama and Katsumi Inoue. Representing priorities in logic programs. In Michael J. Maher, editor, Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming, pages 82-96, Bonn, September 1996. MIT Press.
27. T. Soininen and I. Niemelä. Developing a declarative rule language for applications in product configuration. In Proceedings of the First International Workshop on Practical Aspects of Declarative Languages (PAUL '99), Lecture Notes in Computer Science, San Antonio, Texas, 1999. Springer Verslag.
28. T. Soininen, I. Niemela, J. Tiihonen, and R. Sulonen. Representing configuration knowledge with weight constraint rules. In Proceedings of the AAAI Spring 2001 Symposium on Ans\ver Set Programming: Towards Efficient and Scalable Knowledge, Stanford, USA, 2001.
29. Davy Van Nieuwenborgh and Dirk Vermeir. Preferred answer sets for ordered logic programs. In Flesca et al. [17], pages 432-443.
30. Davy Van Nieuwenborgh and Dirk Vermeir. Order and negation as failure. In Catuscia Palamidessi, editor, Proceedings of the International Conference on Logic Programming, volume 2916 of Lecture Notes in Computer Science, pages 194-208. Springer, 2003.
31. Davy Van Nieuwenborgh and Dirk Vermeir. Ordered diagnosis. In Proceedings of the 10th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR2003), volume 2850 of Lecture Notes in Artificial Intelligence, pages 244-258. Springer Verlag, 2003.
32. Kewen Wang, Lizhu Zhou, and Fangzhen Lin. Alternating fixpoint theory for logic programs with priority. In Proceedings of the International Conference on Computational Logic (CL2000), volume 1861 of Lecture Notes in Computer Science, pages 164-178. Springer, 2000.