scientific article
From MaRDI portal
Publication:2752124
zbMath1015.68197MaRDI QIDQ2752124
Publication date: 29 July 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) General topics in artificial intelligence (68T01)
Related Items
On propositional definability ⋮ What makes propositional abduction tractable ⋮ Some computational aspects of DISTANCE SAT ⋮ Minimal sets on propositional formulae. Problems and reductions ⋮ A general method for deciding about logically constrained issues ⋮ Preservation of Admissibility with Rationality and Feasibility Constraints ⋮ Possibilistic reasoning with partially ordered beliefs ⋮ Explanation of pseudo-Boolean functions using cooperative game theory and prime implicants ⋮ Logical reduction of metarules ⋮ Disjunctive closures for knowledge compilation ⋮ Lifting integrity constraints in binary aggregation ⋮ First order LUB approximations: characterization and algorithms ⋮ Partition-based logical reasoning for first-order and propositional theories ⋮ Consensus-finding that preserves mutually conflicting hypothetical information from a same agent ⋮ Measuring conflict and agreement between two prioritized knowledge bases in possibilistic logic ⋮ Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations ⋮ Metatheory of actions: beyond consistency ⋮ The Computational Complexity of Understanding Binary Classifier Decisions ⋮ On the query complexity of selecting minimal sets for monotone predicates
