Reasoning with prioritized defaults

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

Volumn 1471 LNAI, Issue , 1998, Pages 164-223

  Gelfond, Michael ^a   Son, Tran Cao ^a  

^a University of Texas at El Paso   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; KNOWLEDGE REPRESENTATION; SEMANTICS;

ANSWER SET SEMANTICS; DOMAIN DESCRIPTION; DOMAIN INDEPENDENTS; EXTENDED LOGIC; LOGIC PROGRAMS;

LOGIC PROGRAMMING;

EID: 84867837127     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054795     Document Type: Conference Paper

References (36)

1. Baader, F. and Hollunder, B,: Priorities on Defaults with Prerequisite and their Application in Treating Specificity in Terminological Default Logic, Journal of Automated Reasoning, 15:41-68, 1995.
2. Baral, C. and Gelfond M.: Logic Programming and Knowledge Representation, Journal of Logic Programming, 19, 20: 73-148, 1994.
3. Brass, S. and Dix, J.: A disjunctive semantics based on unfolding and bottom-up evaluation, in Bernd Wolfinger, editor, Innovationen bei Rechen - und Kommunikations systemen, (IFIP '94-Congress, Workshop FG2: Disjunctive Logic Programming and Disjunctive Databases), pages 83-91, 1994, Springer.
4. Brass, S. and Dix, J.: Characterizations of the Disjunctive Stable Semantics by Partial Evaluation, Journal of Logic Programming, 32(3):207-228, 1997.
5. Brewka, G.: Reasoning about Priorities in Default Logic, Proc. AAAI-94, Seattle, 1994
6. Brewka, G.: Adding Priorities and Specificity to Default Logic, Proc. JELIA 94, Springer LNAI 838, 247-260, 1994
7. Brewka, G.: Preferred Answer Sets, Proc. ILPS'97 Postconference Workshop, 76-88, 1997.
8. Covington M.A., Nute D., and Vellino A.: Prolog Programming in Depth, Prentice Hall, NJ, 1997.
9. Chen, W. and Warren, D.S.: Query Evaluation under the Well-Founded Semantics, The Twelfth ACM Symposium on Principles of Database System, 1993.
10. Chen, W.: Extending Prolog with Nonmonotonic Reasoning, Journal of LP, 169-183, 1996.
11. Delgrande, J.P., Schaub, T.H.: Compiling Reasoning with and about Preferences into Default Logic, IJCAi'97, (1997).
12. Dix, J.: Classifying Semantics of Logics Programs. In Proc. of the International Workshop in Logic Programming and Nonmonotonic Reasoning, 166-180, Washington, DC, 1991.
13. Jürgen Dix. A Classification-Theory of Semantics of Normal Logic Programs: I. Strong Properties, Fundamenta Informaticae, XXII(3):227-255, 1995.
14. Jürgen Dix. A Classification-Theory of Semantics of Normal Logic Programs: II. Weak Properties, Fundamenta Informaticae, XXII(3):257-288, 1995.
15. Dung, P.M.: On the Relations Between Stable and Well-Founded Semantics of Logic Programming, Theoretical Computer Science 105:7-25 (1992).
16. Dung, P.M.: On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning and Logic Programming and N-person game. AI (77) 2:321-357 (1995).
17. Fages, F.: Consistency of Clark's Completion and Existence of Stable Models, Technical Report 90-15, Ecole Normale Superieure, 1990.
18. Fishburn, P.C.: Nonlinear Preference and Utility Theory (Johns Hopkins University Press, Baltimore, 1988).
19. Gabbay, D.: Theoretical Foundation for Nonmonotonic Reasoning in Experts System. In K. Apt, editor, Logics and models of Concurrent Systems, 439-457, Springer Verlag, NY, 1985.
20. Gelfond, M., Gabaldon, A.: From Functional Specifications to Logic Programs, 355-370, Proc. of ILPS'97, 1997.
21. Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases, New Generation of Computing 365-387, 1991.
22. Geffner, H., Pearl, J.: Conditional Entailment: Bridging two Approaches to Default Reasoning, Artificial Intelligence 53, 209-244, 1992.
23. Grosof, B.N: Prioritized Conflict Handling for Logic Programs, 197-212, Proc. of ILPS'97, 1997.
24. Gordon, T.: The Pleadings Game: An Artificial Intelligence Model of Procedural Justice. Ph.D. Dissertation, TU Darmstadt.
25. Kosheleva, O.M. and Kreinovich, V.Ya.: Algorithm Problems of Nontransitive (SSB) Utilities, Mathematical Social Sciences 21 (1991) 95-100.
26. Lehnmann, D., Kraus, S., and Magidor, M.: Nonmonotonic Reasoning, Preferential Models and Cumulative Logics, AI (44) 1: 167-207, 1990.
27. Lifschitz, V., Turner, H.: Splitting a Logic Program, Proc. of ICLP, MIT Press, 1994.
28. Marek, W. and Truszczynski, M.: Nonmonotonic Logic: Context-Dependent Reasoning, Springer, 1993.
29. Nelson, D.: Constructible Falsity, JSL 14(1949), 16-26.
30. Nute, D.: A Decidable Quantified Defeasible Logic. In Prawitz, D., Skyrms, B., and Westerstahl, D. (eds): Logic, Methodology and Philosophy of Science IX. Elsevier Science B.V., 263-284, 1994.
31. Pearce, D.: A New Logical Characterization of Stable Models and Answer Sets, NMELP'96, Springer, 57-70, 1997.
32. Prakken, H. and Sartor, G,: On the relation between legal language and legal argument: assumptions, applicability and dynamic priorities. Proc. of the Fifth International Conference on AI and Law, Maryland, College Park, MD USA, 1-10, 1995.
33. Prakken, H. and Sartor, G.: Argument-based extended logic programming with defeasible priorities. Journal of applied non-classical logics, 1, 2 (7), 25-77, 1997.
34. Reiter, R.: On closed world data bases. In H. Gallaire and J. Minker, editors, Logic and data bases, 55-76, 1978.
35. Reiter R.: A Logic for Default Reasoning in Readings in Nonmonotonic Reasoning, Edited by M. L. Ginsberg, Morgan Kaufmann Publishers, Inc., Los Altos, California (1987) 68-93
36. Zhang, Y. and Foo, N.Y.: Answer Sets for Prioritized Logic Programs, 69-84, Proc. of ILPS'97, 1997.