Sciweavers

2084 search results - page 16 / 417
» Set Constraints in Logic Programming
Sort
View
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
ASP
2003
Springer
14 years 1 months ago
Suitable Graphs for Answer Set Programming
Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...
Thomas Linke
VLDB
2002
ACM
156views Database» more  VLDB 2002»
13 years 7 months ago
A Logical Framework for Scheduling Workflows under Resource Allocation Constraints
A workflow consists of a collection of coordinated tasks designed to carry out a welldefined complex process, such as catalog ordering, trip planning, or a business process in an ...
Pinar Senkul, Michael Kifer, Ismail Hakki Toroslu
IJAR
2008
129views more  IJAR 2008»
13 years 8 months ago
Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the trea...
Teresa Alsinet, Carlos Iván Chesñeva...