scientific article; zbMATH DE number 1059246
From MaRDI portal
Publication:4353561
Recommendations
Cited in
(43)- Guarded fixed point logics and the monadic theory of countable trees.
- Deciding the guarded fragments by resolution
- The guarded fragment with transitive guards
- On logics with two variables
- Model checking for hybrid branching-time logics
- Resolution with order and selection for hybrid logics
- Polynomial hierarchy graph properties in hybrid logic
- A tableau decision procedure for \(\mathcal{SHOIQ}\)
- Connectionist computations of intuitionistic reasoning
- Hybrid logics and ontology languages
- Combining theories: the Ackerman and guarded fragments
- Individual Reuse in Description Logic Reasoning
- Why does the proof-theory of hybrid logic work so well?
- scientific article; zbMATH DE number 1346360 (Why is no real title available?)
- A dynamic deontic logic for complex contracts
- On the Restraining Power of Guards
- Global and local graph modifiers
- Semiring Provenance for Guarded Logics
- Structure and Power: an Emerging Landscape
- Bundled fragments of first-order modal logic: (un)decidability
- Rewrite rules for \(\mathrm{CTL}^\ast\)
- scientific article; zbMATH DE number 7104937 (Why is no real title available?)
- Modal Satisfiability via SMT Solving
- Regular graphs and the spectra of two-variable logic with counting
- Guarded negation
- A Decidable Fragment of First Order Modal Logic: Two Variable Term Modal Logic
- Are bundles good deals for first-order modal logic?
- Coalgebraic semantics of modal logics: an overview
- Local closed world reasoning with description logics under the well-founded semantics
- From statistical relational to neurosymbolic artificial intelligence: a survey
- Classical algorithms for reasoning and explanation in description logics
- Model checking timed recursive CTL
- Craig interpolation for decidable first-order fragments
- Intuitionistic \textsf{S4} as a logic of topological spaces
- Craig interpolation for decidable first-order fragments
- Decidability of querying first-order theories via countermodels of finite width
- Representing ontologies using description logics, description graphs, and rules
- Conceptual logic programs
- On the complexity of the two-variable guarded fragment with transitive guards
- Connectionist modal logic: representing modalities in neural networks
- Open answer set programming for the semantic web
- An NP-complete fragment of fibring logic
- A resolution-based decision procedure for \({\mathcal{SHOIQ}}\).
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4353561)
