Sciweavers

Share
SAS
2001
Springer
116views Formal Methods» more  SAS 2001»
8 years 8 months ago
Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...
Frédéric Mesnard, Ulrich Neumerkel
LPNMR
2001
Springer
8 years 8 months ago
Multi-adjoint Logic Programming with Continuous Semantics
Abstract. Considering different implication operators, such as Lukasiewicz, G¨odel or product implication in the same logic program, naturally leads to the allowance of several a...
Jesús Medina, Manuel Ojeda-Aciego, Peter Vo...
LPNMR
2001
Springer
8 years 8 months ago
Multi-dimensional Dynamic Knowledge Representation
Abstract. According to Dynamic Logic Programming (DLP), knowledge may be given by a sequence of theories (encoded as logic programs) representing different states of knowledge. Th...
João Alexandre Leite, José Jú...
ICLP
2001
Springer
8 years 8 months ago
A Multi-adjoint Logic Approach to Abductive Reasoning
Multi-adjoint logic programs has been recently introduced [9, 10] as a generalization of monotonic logic programs [2, 3], in that simultaneous use of several implications in the ru...
Jesús Medina, Manuel Ojeda-Aciego, Peter Vo...
EPIA
2001
Springer
8 years 8 months ago
A Procedural Semantics for Multi-adjoint Logic Programming
Abstract. Multi-adjoint logic program generalise monotonic logic programs introduced in [1] in that simultaneous use of several implications in the rules and rather general connect...
Jesús Medina, Manuel Ojeda-Aciego, Peter Vo...
ICLP
2003
Springer
8 years 9 months ago
Order and Negation as Failure
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...
Davy Van Nieuwenborgh, Dirk Vermeir
ICLP
2003
Springer
8 years 9 months ago
Uniform Equivalence of Logic Programs under the Stable Model Semantics
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
Thomas Eiter, Michael Fink
CIA
2003
Springer
8 years 9 months ago
Logic Programming for Evolving Agents
Abstract. Logic programming has often been considered less than adequate for modelling the dynamics of knowledge changing over time. In this paper we describe Evolving Logic Progra...
José Júlio Alferes, Antonio Brogi, J...
CAEPIA
2003
Springer
8 years 9 months ago
Towards Biresiduated Multi-adjoint Logic Programming
Abstract. Multi-adjoint logic programs were recently proposed as a generalization of monotonic and residuated logic programs, in that simultaneous use of several implications in th...
Jesús Medina, Manuel Ojeda-Aciego, Agust&ia...
ASP
2003
Springer
8 years 9 months ago
Translation of Aggregate Programs to Normal Logic Programs
Abstract. We define a translation of aggregate programs to normal logic programs which preserves the set of partial stable models. We then define the classes of definite and str...
Nikolay Pelov, Marc Denecker, Maurice Bruynooghe
books