The following pages link to On computing minimal models (Q1380414):
Displaying 24 items.
- Generating all maximal models of a Boolean expression (Q294760) (← links)
- On the tractability of minimal model computation for some CNF theories (Q490649) (← links)
- Computing minimal models by partial instantiation (Q672131) (← links)
- Reasoning with minimal models: efficient algorithms and applications (Q1127346) (← links)
- Semantical and computational aspects of Horn approximations (Q1575175) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- Graph-based construction of minimal models (Q2093381) (← links)
- Foundations of the minimal model program (Q2396363) (← links)
- Modular construction of minimal models (Q2401922) (← links)
- An incremental algorithm for generating all minimal models (Q2457647) (← links)
- (Q2723419) (← links)
- MCS Extraction with Sublinear Oracle Queries (Q2818026) (← links)
- (Q3120472) (← links)
- Propositional SAT Solving (Q3176367) (← links)
- Algorithms for Computing Minimal Conflicts (Q3411866) (← links)
- (Q3421442) (← links)
- SAT-Based Horn Least Upper Bounds (Q3453244) (← links)
- All-Termination(T) (Q3617771) (← links)
- (Q4037384) (← links)
- (Q4443550) (← links)
- (Q4451894) (← links)
- Beyond NP: Quantifying over Answer Sets (Q5108497) (← links)
- Logic Programming (Q5191481) (← links)
- On the difference of Horn theories (Q5929916) (← links)