Consequence finding algorithms

MaRDI QIDQ2752124zbMATH OpenFDO

Authors Pierre Marquis

Publication date 29 July 2003

zbMATH Keywords

common sense reasoningconsequence finding

Mathematics Subject Classification ID

General topics in artificial intelligence (68T01) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Recommendations

• Linear resolution for consequence finding
• Semantics and complexity of abduction from default theories
• scientific article; zbMATH DE number 67457
• On computing all abductive explanations from a propositional Horn theory
• SOLAR: a consequence finding system for advanced reasoning

Cited in

(26)

• Metatheory of actions: beyond consistency
• Linear resolution for consequence finding
• Minimal sets on propositional formulae. Problems and reductions
• A general method for deciding about logically constrained issues
• Logical reduction of metarules
• Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations
• On propositional definability
• What makes propositional abduction tractable
• Lifting integrity constraints in binary aggregation
• First order LUB approximations: characterization and algorithms
• Partition-based logical reasoning for first-order and propositional theories
• On the query complexity of selecting minimal sets for monotone predicates
• scientific article; zbMATH DE number 5141522 (Why is no real title available?)
• scientific article; zbMATH DE number 67457 (Why is no real title available?)
• Disjunctive closures for knowledge compilation
• scientific article; zbMATH DE number 1390360 (Why is no real title available?)
• Preservation of Admissibility with Rationality and Feasibility Constraints
• Consensus-finding that preserves mutually conflicting hypothetical information from a same agent
• An automata view to goal-directed methods
• The computational complexity of understanding binary classifier decisions
• Explanation of pseudo-Boolean functions using cooperative game theory and prime implicants
• On the role of logical separability in knowledge compilation
• A new class of explanations for classifiers with non-binary features
• Some computational aspects of DISTANCE SAT
• Possibilistic reasoning with partially ordered beliefs
• Measuring conflict and agreement between two prioritized knowledge bases in possibilistic logic

This page was built for publication: Consequence finding algorithms

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