254 search results - page 36 / 51 » Answer Sets for Propositional Theories |
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. ranki...
AMAI
1999
Springer
13 years 8 months ago
1999
Springer
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
KCAP
2011
ACM
12 years 12 months ago
2011
ACM
Some discourse structures such as enumerative structures have typographical, punctuational and laying out characteristics which (1) make them easily identifiable and (2) convey hi...
ICDT
2012
ACM
11 years 11 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
COCOON
2007
Springer
14 years 3 months ago
2007
Springer
We investigate the connection between propositional proof systems and their canonical pairs. It is known that simulations between proof systems translate to reductions between the...