Pages that link to "Item:Q1367072"
From MaRDI portal
The following pages link to Computing circumscription revisited: A reduction algorithm (Q1367072):
Displaying 26 items.
- The Ackermann approach for modal logic, correspondence theory and second-order reduction (Q420837) (← links)
- Projection and scope-determined circumscription (Q429594) (← links)
- Sahlqvist correspondence for modal mu-calculus (Q454371) (← links)
- John McCarthy's legacy (Q543573) (← links)
- Loop-separable programs and their first-order definability (Q543631) (← links)
- Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA (Q631077) (← links)
- Reasoning with infinite stable models (Q814596) (← links)
- Reasoning under minimal upper bounds in propositional logic (Q861253) (← links)
- Voting by eliminating quantifiers (Q1037605) (← links)
- Formalizing narratives using nested circumscription (Q1274680) (← links)
- Representing action: indeterminacy and ramifications (Q1389538) (← links)
- Annotation theories over finite graphs (Q2269516) (← links)
- Loop formulas for circumscription (Q2457644) (← links)
- Second-order quantifier elimination in higher-order contexts with applications to the semantical analysis of conditionals (Q2462670) (← links)
- Elementary canonical formulae: extending Sahlqvist's theorem (Q2498906) (← links)
- Probabilistic Event Calculus for Event Recognition (Q2946767) (← links)
- Second-Order Quantifier Elimination on Relational Monadic Formulas – A Basic Method and Some Less Expected Applications (Q3455775) (← links)
- Reasoning with different levels of uncertainty (Q3643259) (← links)
- Towards incorporating background theories into quantifier elimination (Q3643319) (← links)
- On the strength and scope of DLS (Q3647241) (← links)
- Second-order reasoning in description logics (Q3647253) (← links)
- Approximate databases: a support tool for approximate reasoning (Q3647257) (← links)
- General domain circumscription and its first-order reduction (Q4632291) (← links)
- SCAN—Elimination of predicate quantifiers (Q4647510) (← links)
- First-Order Resolution Methods for Modal Logics (Q4916086) (← links)
- Dual forgetting operators in the context of weakest sufficient and strongest necessary conditions (Q6152662) (← links)
