Sciweavers

245 search results - page 16 / 49
» Efficient Solving of Time-dependent Answer Set Programs
Sort
View
AICOM
2006
129views more  AICOM 2006»
14 years 12 months ago
A backjumping technique for Disjunctive Logic Programming
In this work we present a backjumping technique for Disjunctive Logic Programming (DLP) under the Answer Set Semantics. It builds upon related techniques that had originally been p...
Francesco Ricca, Wolfgang Faber, Nicola Leone
ICSE
1997
IEEE-ACM
15 years 4 months ago
Lackwit: A Program Understanding Tool Based on Type Inference
By determining, statically, where the structure of a program requires sets of variables to share a common tation, we can identify abstract data types, detect ion violations, find ...
Robert O'Callahan, Daniel Jackson
DLOG
2008
15 years 2 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer
AIPS
2004
15 years 1 months ago
Heuristic Refinements of Approximate Linear Programming for Factored Continuous-State Markov Decision Processes
Approximate linear programming (ALP) offers a promising framework for solving large factored Markov decision processes (MDPs) with both discrete and continuous states. Successful ...
Branislav Kveton, Milos Hauskrecht
HEURISTICS
2008
136views more  HEURISTICS 2008»
14 years 10 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet