Sciweavers

167 search results - page 22 / 34
» Possibilistic-Based Argumentation: An Answer Set Programming...
Sort
View
LPNMR
2007
Springer
14 years 2 months ago
Semantics for Possibilistic Disjunctive Programs
In this paper by considering an answer set programming approach and some basic ideas from possibilistic logic, we introduce a possibilistic disjunctive logic programming approach t...
Juan Carlos Nieves, Mauricio Osorio, Ulises Cort&e...
ICLP
2005
Springer
14 years 1 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
ICLP
2010
Springer
13 years 12 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
SYNTHESE
2011
177views more  SYNTHESE 2011»
13 years 2 months ago
Quantum logic as a dynamic logic
We address the old question whether a logical understanding of Quantum Mechanics requires abandoning some of the principles of classical logic. Against Putnam and others1 , our an...
Alexandru Baltag, Sonja Smets
IJCAI
2003
13 years 9 months ago
Efficient Execution of Recursive Integration Plans
Information integration systems provide a uniform query interface to a set of sources. One of the key challenges for an information integration system is to provide maximally comp...
Snehal Thakkar, Craig A. Knoblock