Pages that link to "Item:Q1267082"
From MaRDI portal
The following pages link to Modal languages and bounded fragments of predicate logic (Q1267082):
Displayed 50 items.
- Translation of first order formulas into ground formulas via a completion theory (Q266881) (← links)
- Towards more expressive ontology languages: the query answering problem (Q359987) (← links)
- Finite satisfiability for guarded fixpoint logic (Q436331) (← links)
- New perspectives in algebraic logic, from neat embeddings to Erdős graphs (Q450159) (← links)
- Consequence-based and fixed-parameter tractable reasoning in description logics (Q490523) (← links)
- Statically safe program generation with SafeGen (Q532402) (← links)
- McCarthy variations in a modal key (Q543607) (← links)
- Modal characterisation theorems over special classes of frames (Q732052) (← links)
- On the modal definability of simulability by finite transitive models (Q763328) (← links)
- \({\mathcal E}\)-connections of abstract description systems (Q814594) (← links)
- Representing ontologies using description logics, description graphs, and rules (Q840831) (← links)
- Conceptual logic programs (Q854977) (← links)
- On the complexity of the two-variable guarded fragment with transitive guards (Q859827) (← links)
- Open answer set programming for the semantic web (Q881833) (← links)
- On the complexity of division and set joins in the relational algebra (Q882434) (← links)
- On updates of hybrid knowledge bases composed of ontologies and rules (Q900304) (← links)
- Deciding expressive description logics in the framework of resolution (Q924723) (← links)
- Ehrenfeucht-Fraïssé games in finite set theory (Q963464) (← links)
- The many faces of interpolation (Q1024113) (← links)
- Modality, bisimulation and interpolation in infinitary logic (Q1295444) (← links)
- On temporal logic versus Datalog (Q1401358) (← links)
- Hyperresolution for guarded formulae (Q1404983) (← links)
- Uniform short proofs for classical theorems (Q1409313) (← links)
- Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators (Q1432885) (← links)
- Decidable fragments of first-order temporal logics (Q1591203) (← links)
- Propositional epistemic logics with quantification over agents of knowledge (Q1743999) (← links)
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width (Q1764811) (← links)
- First order logic without equality on relativized semantics (Q1791054) (← links)
- Relating structure and power: comonadic semantics for computational resources (extended abstract) (Q1798780) (← links)
- Guarded fixed point logics and the monadic theory of countable trees. (Q1853504) (← links)
- Deciding the guarded fragments by resolution (Q1867216) (← links)
- The finite graph problem for two-way alternating automata. (Q1874281) (← links)
- The guarded fragment with transitive guards (Q1877098) (← links)
- Modal and guarded characterisation theorems over finite transition systems (Q1886323) (← links)
- Cylindric algebras and finite polyadic algebras (Q1991591) (← links)
- IF modal logic and classical negation (Q2016064) (← links)
- Statistical \(\mathcal{EL}\) is \textsc{ExpTime}-complete (Q2032149) (← links)
- Positive announcements (Q2046881) (← links)
- Exploiting forwardness: satisfiability and query-entailment in forward guarded fragment (Q2055791) (← links)
- Logical separability of labeled data examples under ontologies (Q2093388) (← links)
- SGGS decision procedures (Q2096457) (← links)
- Model theoretical aspects of weakly aggregative modal logic (Q2155209) (← links)
- Bisimulation invariant monadic-second order logic in the finite (Q2182315) (← links)
- A brief history of Tarskian algebraic logic with new perspectives and innovations (Q2193424) (← links)
- A simple logic of functional dependence (Q2240545) (← links)
- On interpolation in automated theorem proving (Q2352502) (← links)
- Completeness and decidability of general first-order logic (with a detour through the guarded fragment) (Q2363413) (← links)
- On a new semantics for first-order predicate logic (Q2363414) (← links)
- Automated theorem proving by resolution in non-classical logics (Q2385426) (← links)
- On the expressive power of semijoin queries (Q2390289) (← links)