3134 search results - page 9 / 627 » Computing full disjunctions |
ICLP
2003
Springer
14 years 3 months ago
2003
Springer
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...
ICFCA
2007
Springer
14 years 4 months ago
2007
Springer
We model a Digital Library as a formal context in which objects are documents and attributes are terms describing documents contents. A formal concept is very close to the notion o...
CHARME
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We propose a new saturation-based symbolic state-space generation algorithm for finite discrete-state systems. Based on the structure of the high-level model specificat...
KR
2004
Springer
14 years 3 months ago
2004
Springer
The goal of producing a general purpose, semantically motivated, and computationally tractable deductive reasoning service remains surprisingly elusive. By and large, approaches t...
FUIN
2010
13 years 8 months ago
2010
Abstract. Logic Programs with Annotated Disjunctions (LPADs) allow to express probabilistic information in logic programming. The semantics of an LPAD is given in terms of the well...