New tractable classes for default reasoning from conditional knowledge bases

DOI10.1007/S10472-005-9000-3MaRDI QIDQ2502153zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1759386
• Default reasoning from conditional knowledge bases: Complexity and tractable cases
• KI 2004: Advances in Artificial Intelligence
• Realizing Default Logic over Description Logic Knowledge Bases
• Publication:4934647
• Structural inference from conditional knowledge bases
• Possibilistic and standard probabilistic semantics of conditional knowledge bases
• Using approximate reasoning to represent default knowledge
• scientific article; zbMATH DE number 4200176
• A logic with approximate conditional probabilities that can model default reasoning

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1324220 (Why is no real title available?)
• scientific article; zbMATH DE number 1113992 (Why is no real title available?)
• scientific article; zbMATH DE number 1142309 (Why is no real title available?)
• Another perspective on default reasoning
• Default reasoning from conditional knowledge bases: Complexity and tractable cases
• Fourier-Motzkin elimination extension to integer programming problems
• Introduction to algorithms
• Logic applied to integer programming and integer programming applied to logic
• Logic-based decision support. Mixed integer model formulation
• Nested satisfiability
• Nonmonotonic reasoning: From complexity to algorithms
• Satisfiability of co-nested formulas
• Solving propositional satisfiability problems
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• The complexity of theorem-proving procedures
• The logic of conditionals. An application of probability to deductive logic

Cited in

(2)

• scientific article; zbMATH DE number 1759386 (Why is no real title available?)
• Default reasoning from conditional knowledge bases: Complexity and tractable cases

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2502153)