A decision procedure for a temporal belief logic

2005 ◽  
pp. 317-331 ◽  
Author(s):  
Michael Wooldridge ◽  
Michael Fisher
Keyword(s):  
Decision Procedure ◽  
Belief Logic

A Decision Procedure for Bit-Vector Arithmetic

1998 ◽  
Author(s):  
Clark W. Barrett ◽  
David L. Dill ◽  
Jeremy R. Levitt
Keyword(s):  
Decision Procedure ◽  
Bit Vector

Reason-maintenance Belief Logic with Uncertain Information

2020 ◽  
Vol 21 (1) ◽  
pp. 1-32
Author(s):  
Tuan-Fang Fan ◽  
Churn-Jung Liau
Keyword(s):  
Uncertain Information ◽  
Reason Maintenance ◽  
Belief Logic

An Automata-Theoretic Decision Procedure for Propositional Temporal Logic with Since and Until1

1992 ◽  
Vol 17 (3) ◽  
pp. 271-282
Author(s):  
Y.S. Ramakrishna ◽  
L.E. Moser ◽  
L.K. Dillon ◽  
P.M. Melliar-Smith ◽  
G. Kutty
Keyword(s):  
Temporal Logic ◽  
Decision Procedure ◽  
Linear Time ◽  
Computer Systems ◽  
Hierarchical Abstraction ◽  
Soundness And Completeness

We present an automata-theoretic decision procedure for Since/Until Temporal Logic (SUTL), a linear-time propositional temporal logic with strong non-strict since and until operators. The logic, which is intended for specifying and reasoning about computer systems, employs neither next nor previous operators. Such operators obstruct the use of hierarchical abstraction and refinement and make reasoning about concurrency difficult. A proof of the soundness and completeness of the decision procedure is given, and its complexity is analyzed.

Deciding Clause Classes by Semantic Clash Resolution

1993 ◽  
Vol 18 (2-4) ◽  
pp. 163-182
Author(s):  
Alexander Leitsch
Keyword(s):  
Decision Procedure ◽  
Decision Procedures ◽  
General Concept ◽  
Complexity Measure ◽  
Syntactical Structure

It is investigated, how semantic clash resolution can be used to decide some classes of clause sets. Because semantic clash resolution is complete, the termination of the resolution procedure on a class Γ gives a decision procedure for Γ. Besides generalizing earlier results we investigate the relation between termination and clause complexity. For this purpose we define the general concept of atom complexity measure and show some general results about termination in terms of such measures. Moreover, rather than using fixed resolution refinements we define an algorithmic generator for decision procedures, which constructs appropriate semantic refinements out of the syntactical structure of the clause sets. This method is applied to the Bernays – Schönfinkel class, where it gives an efficient (resolution) decision procedure.

Relational dual tableau decision procedure for modal logic K

2011 ◽  
Vol 20 (4) ◽  
pp. 747-756 ◽  
Author(s):  
J. Golinska-Pilarek ◽  
E. Munoz-Velasco ◽  
A. Mora-Bonilla
Keyword(s):  
Modal Logic ◽  
Decision Procedure

An algebraic study of Diodorean modal systems

1965 ◽  
Vol 30 (1) ◽  
pp. 58-64 ◽  
Author(s):  
R. A. Bull
Keyword(s):  
Discrete Time ◽  
Decision Procedure ◽  
John Locke ◽  
Original Model ◽  
Completeness Proof ◽  
Semantic Tableaux ◽  
Algebraic Treatment ◽  
Algebraic Result ◽  
Modal Systems

Attention was directed to modal systems in which ‘necessarily α’ is interpreted as ‘α. is and always will be the case’ by Prior in his John Locke Lectures of 1956. The present paper shows that S4.3, the extension of S4 withALCLpLqLCLqLp,is complete with respect to this interpretation when time is taken to be continuous, and that D, the extension of S4.3 withALNLpLCLCLCpLpLpLp,is complete with respect to this interpretation when time is taken to be discrete. The method employed depends upon the application of an algebraic result of Garrett Birkhoff's to the models for these systems, in the sense of Tarski.A considerable amount of work on S4.3 and D precedes this paper. The original model with discrete time is given in Prior's [7] (p. 23, but note the correction in [8]); that taking time to be continuous yields a weaker system is pointed out by him in [9]. S4.3 and D are studied in [3] of Dummett and Lemmon, where it is shown that D includes S4.3 andCLCLCpLpLpCMLpLp.While in Oxford in 1963, Kripke proved that these were in fact sufficient for D, using semantic tableaux. A decision procedure for S4.3, using Birkhoff's result, is given in my [2]. Dummett conjectured, in a conversation, that taking time to be continuous yielded S4.3. Thus the originality of this paper lies in giving a suitable completeness proof for S4.3, and in the unified algebraic treatment of the systems. It should be emphasised that the credit for first axiomatising D belongs to Kripke.

Sign in / Sign up

Export Citation Format

Share Document