Sciweavers

JAIR
2011
166views more  JAIR 2011»
12 years 11 months ago
Decidability and Undecidability Results for Propositional Schemata
We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions (e.g., pi) and iterated connectives ∨ or ∧ ranging over i...
Vincent Aravantinos, Ricardo Caferra, Nicolas Pelt...
JSAT
2007
47views more  JSAT 2007»
13 years 4 months ago
On Solving Boolean Combinations of UTVPI Constraints
We consider the satisfiability problem for Boolean combinations of unit two variable per inequality (UTVPI) constraints. A UTVPI constraint is linear constraint containing at mos...
Sanjit A. Seshia, K. Subramani, Randal E. Bryant
AMAI
2007
Springer
13 years 4 months ago
Decision procedures for extensions of the theory of arrays
The theory of arrays, introduced by McCarthy in his seminal paper “Toward a mathematical science of computation”, is central to Computer Science. Unfortunately, the theory alo...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
CP
1997
Springer
13 years 8 months ago
Ordering Constraints over Feature Trees
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
Martin Müller, Joachim Niehren, Andreas Podel...
LPAR
2001
Springer
13 years 8 months ago
Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets
Abstract. Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in t...
Volker Diekert, Paul Gastin
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
13 years 10 months ago
Incremental Deterministic Planning
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard
CIE
2007
Springer
13 years 10 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
RP
2009
Springer
103views Control Systems» more  RP 2009»
13 years 10 months ago
On Yen's Path Logic for Petri Nets
In [13], Yen defines a class of formulas for paths in Petri nets and claims that its satisfiability problem is EXPSPACE-complete. In this paper, we show that in fact the satisfi...
Mohamed Faouzi Atig, Peter Habermehl