Sciweavers

583 search results - page 44 / 117
» Preferences in Answer Set Programming
Sort
View
ASP
2005
Springer
15 years 6 months ago
A Preliminary Report on Integrating of Answer Set and Constraint Solving
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input pr...
Sabrina Baselice, Piero A. Bonatti, Michael Gelfon...
FLOPS
2008
Springer
15 years 2 months ago
Integrating Answer Set Reasoning with Constraint Solving Techniques
Abstract. The paper introduces a collection of knowledge representation languages, V(C), parametrised over a class C of constraints. V(C) is an extension of both CR-Prolog and CASP...
Veena S. Mellarkod, Michael Gelfond
ICLP
2010
Springer
15 years 5 months ago
Learning Domain-Specific Heuristics for Answer Set Solvers
In spite of the recent improvements in the performance of Answer Set Programming (ASP) solvers, when the search space is sufficiently large, it is still possible for the search al...
Marcello Balduccini
LPNMR
2004
Springer
15 years 6 months ago
Probabilistic Reasoning With Answer Sets
This paper develops a declarative language, P-log, that combines logical and probabilistic arguments in its reasoning. Answer Set Prolog is used as the logical foundation, while c...
Chitta Baral, Michael Gelfond, J. Nelson Rushton
ICLP
2010
Springer
15 years 5 months ago
Dynamic Magic Sets for Disjunctive Datalog Programs
Abstract. Answer set programming (ASP) is a powerful formalism for knowledge representation and common sense reasoning that allows disjunction in rule heads and nonmonotonic negati...
Mario Alviano