Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
Modal and temporal logic programming
Temporal logics and their applications
Modal resolution in clausal form
Theoretical Computer Science
Nonclausal deduction in first-order temporal logic
Journal of the ACM (JACM)
METATEM: a framework for programming in temporal logic
REX workshop Proceedings on Stepwise refinement of distributed systems: models, formalisms, correctness
A Decision Method for Temporal Logic Based on Resolution
Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science
Temporal Logic with Fixed Points
Temporal Logic in Specification
A Resolution Calculus for Modal Logics
Proceedings of the 9th International Conference on Automated Deduction
The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems
Temporal Logic in Specification
Synthesis of communicating processes from temporal logic specifications
Synthesis of communicating processes from temporal logic specifications
Structure Theorems for Closed Sets of Implicates/ Implicants in Temporal Logic
EPIA '99 Proceedings of the 9th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
A Fixpoint Based Encoding for Bounded Model Checking
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Towards First-Order Temporal Resolution
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Algorithms for Guiding Clausal Temporal Resolution
KI '02 Proceedings of the 25th Annual German Conference on AI: Advances in Artificial Intelligence
Deduction-Based Decision Procedure for a Clausal Miniscoped Fragment of FTL
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
A Simplified Clausal Resolution Procedure for Propositional Linear-Time Temporal Logic
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Game Over: The Foci Approach to LTL Satisfiability and Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Bounded Model Checking with SNF, Alternating Automata, and Büchi Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Connection based strategies for deciding propositional temporal logic
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
A normal form for linear temporal equilibrium logic
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Towards a notion of unsatisfiable cores for LTL
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Temporal logics over transitive states
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Implementing temporal logics: tools for execution and proof
CLIMA'05 Proceedings of the 6th international conference on Computational Logic in Multi-Agent Systems
Towards a notion of unsatisfiable and unrealizable cores for LTL
Science of Computer Programming
Improving testbench evaluation using normalized formal properties
VECoS'09 Proceedings of the Third international conference on Verification and Evaluation of Computer and Communication Systems
Towards formal methods for agent-based systems
1FACS'96 Proceedings of the 1st BCS-FACS conference on Northern Formal Methods
Temporal representation and reasoning in artificial intelligence: A review
Mathematical and Computer Modelling: An International Journal
A cut-free and invariant-free sequent calculus for PLTL
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Invariant-Free Clausal Temporal Resolution
Journal of Automated Reasoning
A survey on temporal logics for specifying and verifying real-time systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
Logical foundations for more expressive declarative temporal logic programming languages
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
In this paper, a resolution method for propositional temporal logic is presented. Temporal formulae, incorporating both past-time and future-time temporal operators, are converted to Separated Normal Form (SNF), then both non-temporal and temporal resolution rules are applied. The resolution method is based on classical resolution, but incorporates a temporal resolution rule that can be implemented efficiently using a graph-theoretic approach.