Satisfiability, Lattices, Temporal Logic and Constraint Logic Programming on Intervals
From MaRDI portal
Publication:5027249
DOI10.1007/978-3-030-71430-7_19OpenAlexW3202069600MaRDI QIDQ5027249FDOQ5027249
Authors: André Vellino
Publication date: 4 February 2022
Published in: Outstanding Contributions to Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-71430-7_19
Recommendations
interval arithmeticproof complexityconstraint logic programmingtemporal logiclattice-theoretic semanticsThich Nhat Hanh
Cites Work
- The undecidability of entailment and relevant implication
- Title not available (Why is that?)
- The complexity of theorem-proving procedures
- Hard examples for resolution
- The Semantics of Predicate Logic as a Programming Language
- The Complexity of Propositional Proofs
- The intractability of resolution
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Title not available (Why is that?)
- Title not available (Why is that?)
- The relative complexity of analytic tableaux and SL-resolution
- Relation algebras and their application in temporal and spatial reasoning
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: Satisfiability, Lattices, Temporal Logic and Constraint Logic Programming on Intervals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5027249)