308 search results - page 46 / 62 » Answer Set Programming Based on Propositional Satisfiability |
AUSAI
2004
Springer
14 years 1 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...
FMCAD
2004
Springer
13 years 11 months ago
2004
Springer
This work presents a memory-efficient All-SAT engine which, given a propositional formula over sets of important and non-important variables, returns the set of all the assignments...
AIMSA
2000
Springer
14 years 4 hour ago
2000
Springer
Inductive Logic Programming (ILP) deals with inducing clausal theories from examples basically through generalization or specialization. The specialization and generalization oper...
HEURISTICS
2002
13 years 7 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
WWW
2007
ACM
14 years 8 months ago
2007
ACM
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...