245 search results - page 13 / 49 » Efficient Solving of Time-dependent Answer Set Programs |
COMPGEOM
1995
ACM
15 years 3 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...
WWW
2004
ACM
16 years 14 days ago
2004
ACM
The wealth of information available on the web makes it an attractive resource for seeking quick answers. While web-based question answering becomes an emerging topic in recent ye...
EOR
2010
14 years 12 months ago
2010
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
178
click to vote
ICLP
2009
Springer
16 years 13 days ago
2009
Springer
When a logic program is processed by an answer set solver, the first task is to generate its instantiation. In a recent paper, Calimeri et el. made the idea of efficient instantiat...
111
click to vote
PPDP
2010
Springer
14 years 9 months ago
2010
Springer
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...