Sciweavers

580 search results - page 58 / 116
» On the Foundations of Answer Set Programming
Sort
View
APLAS
2007
ACM
14 years 21 days ago
Polymorphic Delimited Continuations
Abstract. This paper presents a polymorphic type system for a language with delimited control operators, shift and reset. Based on the monomorphic type system by Danvy and Filinski...
Kenichi Asai, Yukiyoshi Kameyama
ICLP
2010
Springer
14 years 18 days 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
14 years 2 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
13 years 10 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
EPIA
2005
Springer
14 years 2 months ago
Reducing Propositional Theories in Equilibrium Logic to Logic Programs
The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to...
Pedro Cabalar, David Pearce, Agustín Valver...