-
Reasoning on words and trees with data
A data word (resp. a data tree) is a fi-nite word (resp. tree) whose every position carries a letter from a fi-nite alphabet and a datum form an... -
Stålmarck's Algorithm in Coq: A Three-Level Approach
One of the most efficient method to check if a boolean proposition is a tautology is Stålmarck's algorithm. This paper reports on some experiments in integrating this... -
Cooperation of Decision Procedures for the Satisfiability Problem
Constraint programming is strongly based on the use of solvers which are able to check satisfiability of constraints. We show in this paper a rule-based algorithm for... -
On P completeness of some counting problems
We prove that the counting problems #1-in-3Sat, #Not-All-Equal 3Sat and #3-Colorability, whose decision counterparts have been the most frequently used in proving... -
Web services composition verification using satisfiability solving
International audience -
Counting LTL
The original publication is available at ieeexplore.ieee.org. -
Mu-Calculus Based Resolution of XPath Decision Problems
XPath is the standard declarative notation for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization,... -
Counting CTL
34 pages -
A Comparison between SAT and CSP techniques
This dataset has no description
