Sciweavers

839 search results - page 60 / 168
» Answer Set Programming with Resources
Sort
View
IPPS
2002
IEEE
14 years 22 days ago
Achieving Scalability in Parallel Tabled Logic Programs
Tabling or memoing is a technique where one stores intermediate answers to a problem so that they can be reused in further calls. Tabling is of interest to logic programming becau...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...
LADS
2007
Springer
14 years 1 months ago
Facilitating Agent Development in Open Distributed Systems
One of the main reasons about the success of the Web is that many “regular users” are able to create Web pages that, using hyperlinks, incrementally extend both the size and th...
Mauro Gaspari, Davide Guidi
ICLP
2010
Springer
13 years 11 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
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
ESWS
2010
Springer
13 years 9 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