New tractable classes for default reasoning from conditional knowledge bases

DOI10.1007/s10472-005-9000-3zbMath1110.68141OpenAlexW1997610677MaRDI QIDQ2502153

Berilhes Borges Garcia

Publication date: 12 September 2006

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-005-9000-3

zbMATH Keywords

nonmonotonic reasoningtractable classeslexicographic semantics

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nested satisfiability
• Logic applied to integer programming and integer programming applied to logic
• Logic-based decision support. Mixed integer model formulation
• The logic of conditionals. An application of probability to deductive logic
• Fourier-Motzkin elimination extension to integer programming problems
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Nonmonotonic reasoning: From complexity to algorithms
• Satisfiability of co-nested formulas
• Solving propositional satisfiability problems
• Default reasoning from conditional knowledge bases: Complexity and tractable cases
• Another perspective on default reasoning
• The complexity of theorem-proving procedures

This page was built for publication: New tractable classes for default reasoning from conditional knowledge bases