346 search results - page 48 / 70 » Logical omniscience as a computational complexity problem |
CSCLP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Among, Common and Disjoint are global constraints useful in modelling problems involving resources. We study a number of variations of these constraints over integer and ...
AAAI
1994
13 years 9 months ago
1994
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
A channel machine consists of a finite controller together with several fifo channels; the controller can read messages from the head of a channel and write messages to the tail of...
LPNMR
2004
Springer
14 years 29 days ago
2004
Springer
Abstract. This paper studies computational issues related to the problem of reasoning about actions and change (RAC) by exploiting its link with the Answer Set Programming paradigm...
PPDP
2010
Springer
13 years 6 months ago
2010
Springer
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...