A Clausal Resolution Method for Branching-Time Logic ECTL+

Annals of Mathematics and Artificial Intelligence - Netherlands
doi 10.1007/s10472-006-9018-1
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Nature

Related search

A Clausal Resolution Method for Extended Computation Tree Logic ECTL

English

A Resolution Calculus for the Branching-Time Temporal Logic CTL

ACM Transactions on Computational Logic
Computational MathematicsTheoretical Computer ScienceComputer ScienceLogic
2014English

Propositional Clausal Defeasible Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Inductive Equivalence in Clausal Logic and Nonmonotonic Logic Programming

Machine Learning
Artificial IntelligenceSoftware
2010English

Labelled Interpolation Systems for Hyper-Resolution, Clausal, and Local Proofs

Journal of Automated Reasoning
Computational TheorySoftwareArtificial IntelligenceMathematics
2016English

Transition Semantics for Branching Time

Journal of Logic, Language and Information
LinguisticsPhilosophyComputer ScienceLanguage
2015English

Rewrite Methods for Clausal and Non-Clausal Theorem Proving

English

Compositional Analysis for Clausal Exceptives

Semantics and Linguistic Theory
2019English

Α-Quasi-Lock Semantic Resolution Method Based on Lattice-Valued Logic

International Journal of Computational Intelligence Systems
Computational MathematicsComputer Science
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy