Sciweavers

207 search results - page 35 / 42
» Debugging Logic Programs under the Answer Set Semantics
Sort
View
PLILP
1994
Springer
13 years 11 months ago
Combining Lazy Narrowing with Disequality Constraints
Abstract. We investigate an extension of a lazy functional logic language, which uses term disequations both in programs and in computed answers. The semantic properties of the lan...
Puri Arenas-Sánchez, Ana Gil-Luezas, Franci...
LPNMR
2009
Springer
14 years 2 months ago
Relevance-Driven Evaluation of Modular Nonmonotonic Logic Programs
Modular nonmonotonic logic programs (MLPs) under the answer-set semantics have been recently introduced as an ASP formalism in which modules can receive context-dependent input fro...
Minh Dao-Tran, Thomas Eiter, Michael Fink, Thomas ...
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
13 years 11 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
PODS
1989
ACM
129views Database» more  PODS 1989»
13 years 11 months ago
The Alternating Fixpoint of Logic Programs with Negation
The alternating xpoint of a logic program with negation is de ned constructively. The underlying idea is monotonically to build up a set of negative conclusions until the least xp...
Allen Van Gelder
LPNMR
2001
Springer
13 years 12 months ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä