Sciweavers

583 search results - page 63 / 117
» Preferences in Answer Set Programming
Sort
View
CAV
2005
Springer
110views Hardware» more  CAV 2005»
15 years 6 months ago
Extended Weighted Pushdown Systems
Recent work on weighted-pushdown systems shows how to generalize interprocedural-dataflow analysis to answer “stack-qualified queries”, which answer the question “what data...
Akash Lal, Thomas W. Reps, Gogul Balakrishnan
ICLP
2010
Springer
15 years 5 months ago
Dedicated Tabling for a Probabilistic Setting
ProbLog is a probabilistic framework that extends Prolog with probabilistic facts. To compute the probability of a query, the complete SLD proof tree of the query is collected as a...
Theofrastos Mantadelis, Gerda Janssens
ICLP
2005
Springer
15 years 6 months ago
A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems
This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Progra...
Agostino Dovier, Andrea Formisano, Enrico Pontelli
ESWS
2010
Springer
15 years 3 months ago
Dealing with Inconsistency When Combining Ontologies and Rules Using DL-Programs
Abstract. Description Logic Programs (DL-programs) have been introduced to combine ontological and rule-based reasoning in the context of the Semantic Web. A DL-program loosely com...
Jörg Pührer, Stijn Heymans, Thomas Eiter
AAAI
2006
15 years 2 months ago
On the Difficulty of Modular Reinforcement Learning for Real-World Partial Programming
In recent years there has been a great deal of interest in "modular reinforcement learning" (MRL). Typically, problems are decomposed into concurrent subgoals, allowing ...
Sooraj Bhat, Charles Lee Isbell Jr., Michael Matea...