The following pages link to (Q3543581):
Displaying 23 items.
- The Ackermann approach for modal logic, correspondence theory and second-order reduction (Q420837) (← links)
- Projection and scope-determined circumscription (Q429594) (← links)
- Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA (Q631077) (← links)
- Symbol elimination and applications to parametric entailment problems (Q831921) (← links)
- Semantic forgetting in expressive description logics (Q831928) (← links)
- A new methodology for developing deduction methods (Q1037405) (← links)
- Voting by eliminating quantifiers (Q1037605) (← links)
- Discrete dualities for \(n\)-potent MTL-algebras and 2-potent BL-algebras (Q1697346) (← links)
- Higher-order quantifier elimination, counter simulations and fault-tolerant systems (Q2031422) (← links)
- On syntactic forgetting under uniform equivalence (Q2055801) (← links)
- On the limits of forgetting in answer set programming (Q2211850) (← links)
- Stratified guarded first-order transition systems (Q2233528) (← links)
- Annotation theories over finite graphs (Q2269516) (← links)
- FAME(Q): an automated tool for forgetting in description logics with qualified number restrictions (Q2305440) (← links)
- Forgetting in multi-agent modal logics (Q2321251) (← links)
- Second-order quantifier elimination in higher-order contexts with applications to the semantical analysis of conditionals (Q2462670) (← links)
- Knowledge forgetting in propositional \(\mu\)-calculus (Q2679422) (← links)
- Predicate Elimination for Preprocessing in First-Order Theorem Proving (Q2818027) (← links)
- Converse-PDL with regular inclusion axioms: a framework for MAS logics (Q2901207) (← links)
- Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey (Q2970301) (← links)
- Completeness and Correspondence in Hybrid Logic via an Extension of SQEMA (Q4982120) (← links)
- Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments (Q6149592) (← links)
- Dual forgetting operators in the context of weakest sufficient and strongest necessary conditions (Q6152662) (← links)
