641 search results - page 23 / 129 » Embedding Finite Sets in a Logic Programming Language |
136
click to vote
AUSAI
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. A novel declarative approach of forgetting in answer set programming (ASP) has been proposed recently. In this paper we report a system prototype of forgetting in ASP, ca...
123
Voted
AUSAI
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Quantified Boolean formulas (QBFs) play an important role in artificial intelligence subjects, specially in planning, knowledge representation and reasoning [20]. In th...
121
click to vote
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transve...
124
Voted
CADE
2010
Springer
15 years 4 months ago
2010
Springer
This system description provides an overview of the MUNCH reasoner for sets and multisets. MUNCH takes as the input a formula in a logic that supports expressions about sets, multi...
113
Voted
PLDI
2004
ACM
15 years 8 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...