Results 1  10
of
150,097
On the complexity of branchingtime logics
 of Lecture Notes in Computer Science
, 2009
"... Abstract. Hybrid branchingtime logics are introduced as extensions of CT Llike logics with state variables and the downarrowbinder. Following recent work in the linear framework, only logics with a single variable are considered. The expressive power and the complexity of satisfiability of the re ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. Hybrid branchingtime logics are introduced as extensions of CT Llike logics with state variables and the downarrowbinder. Following recent work in the linear framework, only logics with a single variable are considered. The expressive power and the complexity of satisfiability
Memoryfull BranchingTime Logic
"... Abstract. Traditional branchingtime logics such as CTL ⋆ are memoryless: once a path in the computation tree is quantified at a given node, the computation that led to that node is forgotten. Recent work in planing suggests that CTL ⋆ cannot easily express temporal goals that refer to whole computa ..."
Abstract
 Add to MetaCart
Abstract. Traditional branchingtime logics such as CTL ⋆ are memoryless: once a path in the computation tree is quantified at a given node, the computation that led to that node is forgotten. Recent work in planing suggests that CTL ⋆ cannot easily express temporal goals that refer to whole
BranchingTime Logics with Path Relativisation
"... We define extensions of the full branchingtime temporal logic CTL ∗ in which the path quantifiers are relativised by formal languages of infinite words, and consider its natural fragments obtained by extending the logics CTL and CTL+ in the same way. This yields a small and twodimensional hierarch ..."
Abstract
 Add to MetaCart
We define extensions of the full branchingtime temporal logic CTL ∗ in which the path quantifiers are relativised by formal languages of infinite words, and consider its natural fragments obtained by extending the logics CTL and CTL+ in the same way. This yields a small and two
Proof Procedures for BranchingTime Logic Programs
, 1997
"... Traditional implementation techniques for temporal logic programming languages are based on the notion of canonical temporal atoms/clauses. Although such an approach is satisfactory for proving goals that refer to specific moments in time, it usually leads to nonterminating computations when consid ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
considering openended goals. In this paper, we propose a new generalized proof procedure for implementing branching time logic programming languages. The particular strength of the new proof procedure, called CSLDresolution, is that it can handle in a more general way openended queries, without the need
Actual Futures in Peircean BranchingTime Logic
"... In the paper Indeterminsm and the Thin Red Line, Belnap and Green show that the notion of actual future seriously clashes with Objective Indeterminism. However, there are some Computer Science and Artificial Intelligence applications of the formal structure which arises from the actual future point ..."
Abstract
 Add to MetaCart
of view. Of course, these applications have nothing to do with the ontology of objective indeterminism, and so the objections by Belnap and Green do not apply to them. We consider an extension of Peircean branchingtime logic, which contains a new future operator, fA , to be read as `it will happen
Cactus: A branchingtime logic programming language
 Proceedings of the International Joint Conference on Qualitative and Quantitative Practical Reasoning. Lecture Notes in Artificial Intelligence
, 1997
"... Abstract. Temporal programming languages are recognized as natural and expressive formalisms for describing dynamic systems. However, most such languages are based on linear ow of time, a fact that makes them unsuitable for certain types of applications. In this paper we introduce the new temporal l ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
logic programming language Cactus, which is based on a branching notion of time. In Cactus, the truth value of a predicate depends on a hidden time parameter which has a treelike structure. As a result, Cactus appears to be especially appropriate for expressing nondeterministic computations
Finite and Circular Path Models for Branching Time Logics
"... We define various kinds of branching time logic consisting of path quantifiers and secondorder (<oregular) linear time logic which are extensions of CTL * (computation tree logic). These logics are decidable for the computation tree semantics. However, if we adopt the nontree semantics reflect ..."
Abstract
 Add to MetaCart
We define various kinds of branching time logic consisting of path quantifiers and secondorder (<oregular) linear time logic which are extensions of CTL * (computation tree logic). These logics are decidable for the computation tree semantics. However, if we adopt the nontree semantics
On the model checking problem for branching time logics and Basic Parallel Processes
 IN CAV'95, VOLUME 939 OF LNCS
, 1995
"... We investigate the model checking problem for branching time logics and Basic Parallel Processes. We show that the problem is undecidable for the logic 8L(O; F; U) (equivalent to CTL*) in the usual interleaving semantics, but decidable in a standard partial order interpretation. ..."
Abstract

Cited by 27 (1 self)
 Add to MetaCart
We investigate the model checking problem for branching time logics and Basic Parallel Processes. We show that the problem is undecidable for the logic 8L(O; F; U) (equivalent to CTL*) in the usual interleaving semantics, but decidable in a standard partial order interpretation.
Results 1  10
of
150,097