14 search results - page 2 / 3 » Advanced Preprocessing for Answer Set Solving |
LPNMR
2007
Springer
13 years 11 months ago
2007
Springer
We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approach...
ICLP
2010
Springer
13 years 9 months ago
2010
Springer
Answer-set programming (ASP) is a well-known formalism for declarative problem solving, enjoying a continuously increasing number of diverse applications. However, arguably one of ...
AGP
2003
IEEE
13 years 10 months ago
2003
IEEE
Disjunctive Logic Programming (DLP) under the consistent answer set semantics is an advanced formalism for knowledge representation and reasoning. It is, under widely believed assu...
JCDCG
2004
Springer
13 years 10 months ago
2004
Springer
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
COMPGEOM
1995
ACM
13 years 9 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...