Decision Procedure for Temporal Logic of Belief and Actions

Authors:
Regimantas Pliuškevičius;Aida Pliuškevičienė
Affiliations:
Institute of Mathematics and Informatics, Akademijos 4, 08663 Vilnius, Lithuania, e-mail: {regis,aida}@ktl.mii.lt;Institute of Mathematics and Informatics, Akademijos 4, 08663 Vilnius, Lithuania, e-mail: {regis,aida}@ktl.mii.lt
Venue:
Informatica
Year:
2004

Citing 11
Cited 1

Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Basic modal logic

Handbook of logic in artificial intelligence and logic programming (vol. 1)
Clausal temporal resolution

ACM Transactions on Computational Logic (TOCL)
Deduction systems for BDI logics using sequent calculus

Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Epistemic Logic for AI and Computer Science

Epistemic Logic for AI and Computer Science
Dynamic Logic

Dynamic Logic
Similarity Saturation for First Order Linear Temporal Logic with UNLESS

JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
Gentzen Style Systems for K45 and K45D

Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at Botik '89
On the Saturation Principle for a Linear Temporal Logic

KGC '93 Proceedings of the Third Kurt Gödel Colloquium on Computational Logic and Proof Theory
Investigation of Finitary Calculus for a Discrete Linear Time Logic by means of Infinitary Calculus

Baltic Computer Science, Selected Papers
Deduction-Based Decision Procedure for a Clausal Miniscoped Fragment of FTL

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning

Termination of Derivations in a Fragment of Transitive Distributed Knowledge Logic

Informatica

Quantified Score

Hi-index	0.00

Visualization

Abstract

A temporal logic of belief and actions (TLBA) is considered. The TLBA allows us to express informational and dynamic properties of computational agents. The considered fragment of TLBA allows one: (1) to present a deduction-based structured decision procedure; (2) to separate a decision procedure for so-called induction-free formulas and (3) to use only logical axioms for such formulas. The main new technical tool of the presented decision procedure is separation rules which incorporate traditional rules for the temporal operator “next”, belief modalities and action constants.