Sciweavers

570 search results - page 16 / 114
» The Complexity of Reasoning with Global Constraints
Sort
View
93
Voted
IJCAI
2007
14 years 11 months ago
Constraint Partitioning for Solving Planning Problems with Trajectory Constraints and Goal Preferences
The PDDL3 specifications include soft goals and trajectory constraints for distinguishing highquality plans among the many feasible plans in a solution space. To reduce the compl...
Chih-Wei Hsu, Benjamin W. Wah, Ruoyun Huang, Yixin...
CONSTRAINTS
2007
93views more  CONSTRAINTS 2007»
14 years 9 months ago
Arc-B-consistency of the Inter-distance Constraint
We study the “inter-distance constraint”, also known as the global minimum distance constraint, that ensures that the distance between any pair of variables is at least equal ...
Konstantin Artiouchine, Philippe Baptiste
70
Voted
ER
2007
Springer
108views Database» more  ER 2007»
15 years 3 months ago
Reasoning over Extended ER Models
Abstract. We investigate the computational complexity of reasoning over various fragments of the Extended Entity-Relationship (EER) language, which includes a number of constructs:...
Alessandro Artale, Diego Calvanese, Roman Kontchak...
81
Voted
LICS
1999
IEEE
15 years 1 months ago
Entailment of Atomic Set Constraints is PSPACE-Complete
The complexity of set constraints has been extensively studied over the last years and was often found quite high. At the lower end of expressiveness, there are atomic set constra...
Joachim Niehren, Martin Müller, Jean-Marc Tal...
RR
2010
Springer
14 years 8 months ago
Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination on RDF graphs in the presence of rules (in the form of Datalog r...
Reinhard Pichler, Axel Polleres, Sebastian Skritek...