Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/new-tractable-classes-for-default-reasoning-from-conditional-knowledge-mNwhQlOCHz
References (15)
-
K.S. Booth, G.S. Lueker (1976)
Testing for the consecutive ones property, interval graphs, and graph planarity using P–Q tree algorithmsJournal of Comparative System Science, 13
-
C. Cayrol, M.C. Lagasquie-Schiex, T. Schiex (1998)
Nonmonotonic reasoning: From complexity to algorithmsAnnals of Mathematics and Artificial Intelligence, 22
-
J. Kratochvíl, M. Køivánek (1993)
Satisfiability of co-nested formulasActa Informatica, 30
-
J. Pearl (1989)
KR'89: Principles of Knowledge Representation and Reasoning -
H.P. Williams (1976)
Fourier–Motzkin elimination extension to integer programming problemsJournal of Combinatorial Theory (A), 21
-
V. Chandru, V.S. Jayachandran (1994)
Maxsat and related problems on extended nested propositions -
M.R. Garey, D.S. Johnson (1978)
Computers and Intractability A Guide to the Theory of NP-Completeness -
M. Goldszmidt, P. Morris, J. Pearl (1993)
A maximum entropy approach to nonmonotonic reasoningIEEE Transactions of Pattern Analysis and Machine Intelligence, 15
-
M. Goldszmidt, J. Pearl (1996)
Qualitative probabilities for default reasoning, belief revision, and causal modelingArtificial Intelligence, 84
-
R.G. Jeroslow, J. Wang (1990)
Solving propositional satisfiability problemsAnnals of Mathematics and Artificial Intelligence, 1
-
D.E. Knuth (1990)
Nested satisfiabilityActa Informatica, 28
-
D. Lehmann (1995)
Another perspective on default reasoningAnnals of Mathematics and Artificial Intelligence, 15
-
H.P. Williams (1995)
Logic applied to integer programming and integer programming applied to logicEuropean Journal of Operational Research, 81
-
T. Eiter, T. Lukasiewicz (2000)
Complexity results for default reasoning from conditional knowledge basesArtificial Intelligence, 124
-
R.G. Jeroslow (1988)
Logic-Based Decision Support. Mixed Integer Model Formulation
- Publisher
- Springer Journals
- Copyright
- Copyright © 2005 by Springer Science+Business Media, Inc.
- Subject
- Computer Science; Complexity; Computer Science, general ; Mathematics, general; Artificial Intelligence (incl. Robotics)
- ISSN
- 1012-2443
- eISSN
- 1573-7470
- DOI
- 10.1007/s10472-005-9000-3
- Publisher site
- See Article on Publisher Site
Abstract
This paper refines the tractability/intractability frontier of default reasoning from conditional knowledge bases. It presents two new tractable cases with relation to lexicographic entailment. In particular, we have introduced nested conditional knowledge bases and co-nested conditional knowledge bases, which are meaningful conditional knowledge bases. Both tractable classes presented in this paper can be recognized in linear time.
Journal
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Nov 16, 2005