Sciweavers

570 search results - page 17 / 114
» The Complexity of Reasoning with Global Constraints
Sort
View
ICTL
1994
15 years 1 months ago
Abduction in Temporal Reasoning
Commonsense knowledge often omits the temporal incidence of facts, and even the ordering between occurrences is only available for some of their instances. Reasoning about the temp...
Cristina Ribeiro, António Porto
KRDB
2001
110views Database» more  KRDB 2001»
14 years 11 months ago
Path Constraints from a Modal Logic Point of View
We analyze several classes of path constraints for semistructured data in a unified framework and prove some decidability and complexity results for these constraints by embedding...
Natasha Alechina, Stéphane Demri, Maarten d...
LICS
2012
IEEE
13 years 1 days ago
Near Unanimity Constraints Have Bounded Pathwidth Duality
—We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded...
Libor Barto, Marcin Kozik, Ross Willard
84
Voted
AAAI
2008
14 years 12 months ago
Reasoning with Cardinal Directions: An Efficient Algorithm
Direction relations between extended spatial objects are important commonsense knowledge. Recently, Goyal and Egenhofer proposed a formal model, called Cardinal Direction Calculus...
Xiaotong Zhang, Weiming Liu, Sanjiang Li, Mingshen...
CSCLP
2005
Springer
15 years 3 months ago
Complete Propagation Rules for Lexicographic Order Constraints over Arbitrary Domains
We give an efficiently executable specification of the global constraint of lexicographic order in the Constraint Handling Rules (CHR) language. In contrast to previous approaches...
Thom W. Frühwirth