Results 1  10
of
10
TeMP: A Temporal Monodic Prover
 In Proc. IJCAR04, LNAI
, 2004
"... We present TeMPthe first experimental system for testing validity of monodic temporal logic formulae. The prover implements finegrained temporal resolution. The core operations required by the procedure are performed by an efficient resolutionbased prover for classical firstorder logic. ..."
Abstract

Cited by 21 (11 self)
 Add to MetaCart
(Show Context)
We present TeMPthe first experimental system for testing validity of monodic temporal logic formulae. The prover implements finegrained temporal resolution. The core operations required by the procedure are performed by an efficient resolutionbased prover for classical firstorder logic.
TRP ++ : A temporal resolution prover
 In Collegium Logicum
, 2002
"... this paper. 2 Basics of PLTL Let P be a set of propositional variables. The set of formulae of propositional linear time logic PLTL (over P) is inductively defined as follows: (i) ? is a formula of PLTL, (ii) every propositional variable of P is a formula of PLTL, (iii) if ' and / are formula ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
(Show Context)
this paper. 2 Basics of PLTL Let P be a set of propositional variables. The set of formulae of propositional linear time logic PLTL (over P) is inductively defined as follows: (i) ? is a formula of PLTL, (ii) every propositional variable of P is a formula of PLTL, (iii) if ' and / are formulae of PLTL, then :' and (' /) are formulae of PLTL, and (iv) if ' and / are formulae of PLTL, then #' (in the next moment of time ' is true), 3' (sometimes in the future ' is true), 2' (always in the future ' is true), (' U /) (' is true until / is true), and (' W /) (' is true unless / is true) are formulae of PLTL. Other Boolean connectives including ?, , !, and $ are defined using ?, :, and
Linear temporal logic as an executable semantics for planning languages
 Journal of Logic, Lang and Information
"... This is a draft version of a paper appeared on the Journal of Logic, Language and Information. It should not be cited, quoted or reproduced. This paper presents an approach to artificial intelligence planning based on linear temporal logic (LTL). A simple and easytouse planning language is describ ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
(Show Context)
This is a draft version of a paper appeared on the Journal of Logic, Language and Information. It should not be cited, quoted or reproduced. This paper presents an approach to artificial intelligence planning based on linear temporal logic (LTL). A simple and easytouse planning language is described, PDDLK (Planning Domain Description Language with control Knowledge), which allows one to specify a planning problem together with heuristic information that can be of help for both pruning the search space and finding better quality plans. The semantics of the language is given in terms of a translation into a set of LTL formulae. Planning is then reduced to “executing ” the LTL encoding, i.e. to model search in LTL. The feasibility of the approach has been successfully tested by means of the system Pdk, an implementation of the proposed method. 1
Temporal Logic with Capacity Constraints
"... Abstract. Often when modelling systems, physical constraints on the resources available are needed. For example, we might say that at most N processes can access a particular resource at any moment or exactly M participants are needed for an agreement. Such situations are concisely modelled where pr ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
(Show Context)
Abstract. Often when modelling systems, physical constraints on the resources available are needed. For example, we might say that at most N processes can access a particular resource at any moment or exactly M participants are needed for an agreement. Such situations are concisely modelled where propositions are constrained such that at most N, or exactly M, can hold at any moment in time. This paper describes both the logical basis and a verification method for propositional linear time temporal logics which allow such constraints as input. The method incorporates ideas developed earlier for a resolution method for the temporal logic TLX and a tableauxlike procedure for PTL. The complexity of this procedure is discussed and case studies are examined. The logic itself represents a combination of standard temporal logic with classical constraints restricting the numbers of propositions that can be satisfied at any moment in time. 1
Evaluating LTL Satisfiability Solvers
"... Abstract. We perform a comprehensive experimental evaluation of offtheshelf solvers for satisfiability of propositional LTL. We consider a wide range of solvers implementing three major classes of algorithms: reduction to model checking, tableaubased approaches, and temporal resolution. Our set of ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
Abstract. We perform a comprehensive experimental evaluation of offtheshelf solvers for satisfiability of propositional LTL. We consider a wide range of solvers implementing three major classes of algorithms: reduction to model checking, tableaubased approaches, and temporal resolution. Our set of benchmark families is significantly more comprehensive than those in previous studies. It takes the benchmark families of previous studies, which only have a limited overlap, and adds benchmark families not used for that purpose before. We find that no solver dominates or solves all instances. Solvers focused on finding models and solvers using temporal resolution or fixed point computation show complementary strengths and weaknesses. This motivates and guides estimation of the potential of a portfolio solver. It turns out that even combining two solvers in a simple fashion significantly increases the share of solved instances while reducing CPU time spent. 1
Taming the Complexity of Temporal Epistemic Reasoning
"... Abstract. Temporal logic of knowledge is a combination of temporal and epistemic logic that has been shown to be very useful in areas such as distributed systems, security, and multiagent systems. However, the complexity of the logic can be prohibitive. We here develop a refined version of such a l ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
Abstract. Temporal logic of knowledge is a combination of temporal and epistemic logic that has been shown to be very useful in areas such as distributed systems, security, and multiagent systems. However, the complexity of the logic can be prohibitive. We here develop a refined version of such a logic and associated tableau procedure with improved complexity but where important classes of specification can still be described. This new logic represents a combination of an “exactly one ” temporal logic with an S5 multimodal logic again restricted to the “exactly one ” form. 1
Deductive Temporal Reasoning with Constraints
"... When modelling realistic systems, physical constraints on the resources available are often required. For example, we might say that at most N processes can access a particular resource at any moment, exactly M participants are needed for an agreement, or an agent can be in exactly one mode at any m ..."
Abstract
 Add to MetaCart
(Show Context)
When modelling realistic systems, physical constraints on the resources available are often required. For example, we might say that at most N processes can access a particular resource at any moment, exactly M participants are needed for an agreement, or an agent can be in exactly one mode at any moment. Such situations are concisely modelled where literals are constrained such that at most N, or exactly M, can hold at any moment in time. In this paper we consider a logic which is a combination of standard propositional linear time temporal logic with cardinality constraints restricting the numbers of literals that can be satisfied at any moment in time. We present the logic and and show how to represent a number of case studies using this logic. We propose a tableaulike algorithm for checking the satisfiability of formulae in this logic, provide details of a prototype implementation and present experimental results using the prover.
Implementing Tractable Temporal Logics
"... Abstract. In this paper, we describe an implementation of a new calculus for a fragment of propositional lineartime logic (PLTL). This fragment is a subclass of PLTL which can be used to capture Büchi automata. Further, the complexity of this calculus for the fragment is polynomial, whereas the co ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. In this paper, we describe an implementation of a new calculus for a fragment of propositional lineartime logic (PLTL). This fragment is a subclass of PLTL which can be used to capture Büchi automata. Further, the complexity of this calculus for the fragment is polynomial, whereas the complexity of satisfiability for full PLTL is PSPACEcomplete. This provides an efficient method of theorem proving for formulae within this fragment as well as providing an alternative way to check the emptiness of Büchi automata. A description of the implementation and an example of its usage are given. Finally, we compare our system with TRP++, a PLTL resolution theorem prover, and give conclusions. 1
Pdk: the System and its Language
"... TABLEAUX 2005. It should not be cited, quoted or reproduced. This paper presents the planning system Pdk (Planning with Domain Knowledge), based on the translation of planning problems into Linear Time Logic theories, in such a way that finding solution plans is reduced to model search. The model se ..."
Abstract
 Add to MetaCart
(Show Context)
TABLEAUX 2005. It should not be cited, quoted or reproduced. This paper presents the planning system Pdk (Planning with Domain Knowledge), based on the translation of planning problems into Linear Time Logic theories, in such a way that finding solution plans is reduced to model search. The model search mechanism is based on temporal tableaux. The planning language accepted by the system allows one to specify extra problem dependent information, that can be of help both in reducing the search space and finding plans of better quality. 1