Paraconsistent computation tree logic
From MaRDI portal
Publication:1758667
DOI10.1007/s00354-009-0116-6zbMath1251.68227OpenAlexW2003090976MaRDI QIDQ1758667
Publication date: 16 November 2012
Published in: New Generation Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00354-009-0116-6
Logic in artificial intelligence (68T27) Reasoning under uncertainty in the context of artificial intelligence (68T37) Specification and verification (program logics, model checking, etc.) (68Q60) Paraconsistent logics (03B53)
Related Items (2)
Refutation-aware Gentzen-style calculi for propositional until-free linear-time temporal logic ⋮ Inconsistency-tolerant temporal reasoning with hierarchical information
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Order-sorted logic programming with predicate hierarchy
- Combining linear-time temporal logic with constructiveness and paraconsistency
- On the complexities of consistency checking for restricted UML class diagrams
- Introduction: Paraconsistent logics
- Intuitionistic logic with strong negation
- The logic of information structures
- Linear and affine logics with temporal, spatial and epistemic operators
- Description logics with contraries, contradictories, and subcontraries
- Counterexample-guided abstraction refinement for symbolic model checking
- Constructible falsity and inexact predicates
- Logic Programming with Strong Negation and Inexact Predicates
- Aspects of Paraconsistent Logic
- Constructible falsity
- SOFSEM 2006: Theory and Practice of Computer Science
- Tools and Algorithms for the Construction and Analysis of Systems
This page was built for publication: Paraconsistent computation tree logic
