Sciweavers

599 search results - page 22 / 120
» Integrating answer set programming and constraint logic prog...
Sort
View
LPNMR
2005
Springer
15 years 11 months ago
Guarded Open Answer Set Programming
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
JAR
2006
94views more  JAR 2006»
15 years 5 months ago
Answer Set Programming Based on Propositional Satisfiability
Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the...
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea
ECAI
2010
Springer
15 years 7 months ago
On Semantic Update Operators for Answer-Set Programs
Logic programs under the stable models semantics, or answer-set programs, provide an expressive rule based knowledge representation framework, featuring formal, declarative and wel...
Martin Slota, João Leite
PLILP
1993
Springer
15 years 10 months ago
Narrowing Approximations as an Optimization for Equational Logic Programs
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
María Alpuente, Moreno Falaschi, Marí...
LPNMR
2007
Springer
16 years 11 hour ago
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
Michael Fink, Reinhard Pichler, Hans Tompits, Stef...