The following pages link to Consequence finding algorithms (Q2752124):
Displaying 23 items.
- On the query complexity of selecting minimal sets for monotone predicates (Q253999) (← links)
- Disjunctive closures for knowledge compilation (Q460617) (← links)
- Some computational aspects of DISTANCE SAT (Q877840) (← links)
- Possibilistic reasoning with partially ordered beliefs (Q893599) (← links)
- Measuring conflict and agreement between two prioritized knowledge bases in possibilistic logic (Q983062) (← links)
- Metatheory of actions: beyond consistency (Q1028966) (← links)
- Linear resolution for consequence finding (Q1199916) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- A general method for deciding about logically constrained issues (Q1926579) (← links)
- Logical reduction of metarules (Q2203321) (← links)
- Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations (Q2278099) (← links)
- On propositional definability (Q2389643) (← links)
- What makes propositional abduction tractable (Q2389658) (← links)
- Lifting integrity constraints in binary aggregation (Q2446586) (← links)
- First order LUB approximations: characterization and algorithms (Q2457687) (← links)
- Partition-based logical reasoning for first-order and propositional theories (Q2457688) (← links)
- (Q3431492) (← links)
- (Q4934652) (← links)
- Preservation of Admissibility with Rationality and Feasibility Constraints (Q5098753) (← links)
- Consensus-finding that preserves mutually conflicting hypothetical information from a same agent (Q5145440) (← links)
- The Computational Complexity of Understanding Binary Classifier Decisions (Q5856459) (← links)
- On the role of logical separability in knowledge compilation (Q6494362) (← links)
- A new class of explanations for classifiers with non-binary features (Q6545524) (← links)
