Sciweavers

316 search results - page 27 / 64
» Expressiveness of graph conditions with variables
Sort
View
70
Voted
JAIR
2008
111views more  JAIR 2008»
14 years 9 months ago
New Islands of Tractability of Cost-Optimal Planning
We study the complexity of cost-optimal classical planning over propositional state variables and unary-effect actions. We discover novel problem fragments for which such optimiza...
Michael Katz, Carmel Domshlak
CAV
2004
Springer
99views Hardware» more  CAV 2004»
15 years 3 months ago
Range Allocation for Separation Logic
Abstract. Separation Logic consists of a Boolean combination of predicates of the form vi ≥ vj +c where c is a constant and vi, vj are variables of some ordered infinite type li...
Muralidhar Talupur, Nishant Sinha, Ofer Strichman,...
JAR
2006
236views more  JAR 2006»
14 years 9 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
IDEAS
2005
IEEE
111views Database» more  IDEAS 2005»
15 years 3 months ago
Evaluation of Queries on Tree-Structured Data Using Dimension Graphs
The recent proliferation of XML-based standards and technologies for managing data on the Web demonstrates the need for effective and efficient management of treestructured data....
Theodore Dalamagas, Dimitri Theodoratos, Antonis K...
ICTAC
2005
Springer
15 years 3 months ago
Stochastic Analysis of Graph Transformation Systems: A Case Study in P2P Networks
In distributed and mobile systems with volatile bandwidth and fragile connectivity, non-functional aspects like performance and reliability become more and more important. To forma...
Reiko Heckel