Pages that link to "Item:Q1581852"
From MaRDI portal
The following pages link to Positive unit hyperresolution tableaux and their application to minimal model generation (Q1581852):
Displayed 18 items.
- A relevance restriction strategy for automated deduction (Q814429) (← links)
- Representing and building models for decidable subclasses of equational clausal logic (Q861367) (← links)
- Some techniques for proving termination of the hyperresolution calculus (Q861692) (← links)
- Notions of sameness by default and their application to anaphora, vagueness, and uncertain reasoning (Q1024815) (← links)
- Completeness of hyper-resolution via the semantics of disjunctive logic programs (Q1041788) (← links)
- Model building with ordered resolution: Extracting models from saturated clause sets (Q1404975) (← links)
- Eliminating redundant search space on backtracking for forward chaining theorem proving (Q1412130) (← links)
- \(\mathcal I\)-SATCHMORE: An improvement of \(\mathcal A\)-SATCHMORE (Q1429427) (← links)
- SATCHMOREBID: SATCHMO(RE) with BIDirectional relevancy (Q1877374) (← links)
- Paracoherent answer set computation (Q2238696) (← links)
- Blocking and other enhancements for bottom-up model generation methods (Q2303239) (← links)
- An incremental algorithm for generating all minimal models (Q2457647) (← links)
- A Tableau Calculus for Minimal Modal Model Generation (Q2825415) (← links)
- Exploring Theories with a Model-Finding Assistant (Q3454114) (← links)
- Cautious reasoning in ASP via minimal models and unsatisfiable cores (Q4559795) (← links)
- First-Order Resolution Methods for Modal Logics (Q4916086) (← links)
- Better Paracoherent Answer Sets with Less Resources (Q5108500) (← links)
- ASP and subset minimality: enumeration, cautious reasoning and MUSes (Q6103676) (← links)