10 research outputs found
Satisfiability of CTL* with constraints
We show that satisfiability for CTL* with equality-, order-, and
modulo-constraints over Z is decidable. Previously, decidability was only known
for certain fragments of CTL*, e.g., the existential and positive fragments and
EF.Comment: To appear at Concur 201
Satisfiability of ECTL* with tree constraints
Recently, we have shown that satisfiability for with
constraints over is decidable using a new technique. This approach
reduces the satisfiability problem of with constraints over
some structure A (or class of structures) to the problem whether A has a
certain model theoretic property that we called EHD (for "existence of
homomorphisms is decidable"). Here we apply this approach to concrete domains
that are tree-like and obtain several results. We show that satisfiability of
with constraints is decidable over (i) semi-linear orders
(i.e., tree-like structures where branches form arbitrary linear orders), (ii)
ordinal trees (semi-linear orders where the branches form ordinals), and (iii)
infinitely branching trees of height h for each fixed . We
prove that all these classes of structures have the property EHD. In contrast,
we introduce Ehrenfeucht-Fraisse-games for (weak
with the bounding quantifier) and use them to show that the
infinite (order) tree does not have property EHD. As a consequence, a different
approach has to be taken in order to settle the question whether satisfiability
of (or even ) with constraints over the
infinite (order) tree is decidable
On the Satisfiability of Temporal Logics with Concrete Domains
Temporal logics are a very popular family of logical languages, used to specify properties of abstracted systems. In the last few years, many extensions of temporal logics have been proposed, in order to address the need to express more than just abstract properties.
In our work we study temporal logics extended by local constraints, which allow to express quantitative properties on data values from an arbitrary relational structure called the concrete domain.
An example of concrete domain can be (Z, <, =), where the integers are considered as a relational structure over the binary order relation and the equality relation.
Formulas of temporal logics with constraints are evaluated on data-words or data-trees, in which each node or position is labeled by a vector of data from the concrete domain. We call the constraints local because they can only compare values at a fixed distance inside such models.
Several positive results regarding the satisfiability of LTL (linear temporal logic) with constraints over the integers have been established in the past years, while the corresponding results for branching time logics were only partial.
In this work we prove that satisfiability of CTL* (computation tree logic) with
constraints over the integers is decidable and also lift this result to ECTL*, a proper extension of CTL*.
We also consider other classes of concrete domains, particularly ones that are \"tree-like\". We consider semi-linear orders, ordinal trees and trees of a fixed height, and prove decidability in this framework as well. At the same time we prove that our method cannot be applied in the case of the infinite binary tree or the infinitely branching infinite tree.
We also look into extending the expressiveness of our logic adding non-local constraints, and find that this leads to undecidability of the satisfiability problem, even on very simple domains like (Z, <, =). We then find a way to restrict the power of the non-local constraints to regain decidability
Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures
We introduce the class of tree constraint automata with data values in Z
(equipped with the less than relation and equality predicates to constants) and
we show that the nonemptiness problem is ExpTime-complete. Using an
automata-based approach, we establish that the satisfiability problem for
CTL(Z) (CTL with constraints in Z) is ExpTime-complete and the satisfiability
problem for CTL*(Z) is 2ExpTime-complete solving a longstanding open problem
(only decidability was known so far). By-product results with other concrete
domains and other logics, such as description logics with concrete domains, are
also briefly presented
Probabilistic Logic, Probabilistic Regular Expressions, and Constraint Temporal Logic
The classic theorems of BĂŒchi and Kleene state the expressive equivalence of finite automata to monadic second order logic and regular expressions, respectively. These fundamental results enjoy applications in nearly every field of theoretical computer science. Around the same time as BĂŒchi and Kleene, Rabin investigated probabilistic finite automata. This equally well established model has applications ranging from natural language processing to probabilistic model checking.
Here, we give probabilistic extensions BĂŒchi\\\''s theorem and Kleene\\\''s theorem to the probabilistic setting. We obtain a probabilistic MSO logic by adding an expected second order quantifier. In the scope of this quantifier, membership is determined by a Bernoulli process. This approach turns out to be universal and is applicable for finite and infinite words as well as for finite trees. In order to prove the expressive equivalence of this probabilistic MSO logic to probabilistic automata, we show a Nivat-theorem, which decomposes a recognisable function into a regular language, homomorphisms, and a probability measure.
For regular expressions, we build upon existing work to obtain probabilistic regular expressions on finite and infinite words. We show the expressive equivalence between these expressions and probabilistic Muller-automata. To handle Muller-acceptance conditions, we give a new construction from probabilistic regular expressions to Muller-automata. Concerning finite trees, we define probabilistic regular tree expressions using a new iteration operator, called infinity-iteration. Again, we show that these expressions are expressively equivalent to probabilistic tree automata.
On a second track of our research we investigate Constraint LTL over multidimensional data words with data values from the infinite tree. Such LTL formulas are evaluated over infinite words, where every position possesses several data values from the infinite tree. Within Constraint LTL on can compare these values from different positions. We show that the model checking problem for this logic is PSPACE-complete via investigating the emptiness problem of Constraint BĂŒchi automata
Automated Reasoning
This volume, LNAI 13385, constitutes the refereed proceedings of the 11th International Joint Conference on Automated Reasoning, IJCAR 2022, held in Haifa, Israel, in August 2022. The 32 full research papers and 9 short papers presented together with two invited talks were carefully reviewed and selected from 85 submissions. The papers focus on the following topics: Satisfiability, SMT Solving,Arithmetic; Calculi and Orderings; Knowledge Representation and Jutsification; Choices, Invariance, Substitutions and Formalization; Modal Logics; Proofs System and Proofs Search; Evolution, Termination and Decision Prolems. This is an open access book