150 search results - page 21 / 30 » Complexity of the Unique Extension Problem in Default Logic |
100
click to vote
LOPSTR
2005
Springer
15 years 3 months ago
2005
Springer
We propose an extension of functional logic languages that allows the definition of operations with patterns containing other defined operation symbols. Such “function patterns...
AAAI
2000
14 years 10 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
DESRIST
2009
Springer
15 years 22 days ago
2009
Springer
In this paper, we describe the concept of ontological design. We show how ontologies can be used as cognitive maps of complex, ill-structured, plastic problems. They can be used t...
FOSSACS
2008
Springer
14 years 11 months ago
2008
Springer
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter au...
PODS
2010
ACM
14 years 11 months ago
2010
ACM
Schema mappings are high-level specifications that describe the relationship between two database schemas; they are considered to be the essential building blocks in data exchange...