Sciweavers

117 search results - page 7 / 24
» A Dynamic Approach to Characterizing Termination of General ...
Sort
View
ECAI
2000
Springer
13 years 11 months ago
Logic Programs with Compiled Preferences
Abstract. We describe an approach for compiling dynamic preferences into logic programs under the answer set semantics. An ordered logic program is an extended logic program in whi...
James P. Delgrande, Torsten Schaub, Hans Tompits
CIA
2003
Springer
14 years 19 days 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...
WCFLP
2005
ACM
14 years 29 days ago
Lightweight program specialization via dynamic slicing
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
Claudio Ochoa, Josep Silva, Germán Vidal
AGP
2003
IEEE
14 years 21 days ago
An Evolving Agent with EVOLP
Abstract. Logic programming has often been considered less than adequate for modelling the dynamics of knowledge changing over time. Evolving Logic Programs (EVOLP) has been recent...
José Júlio Alferes, Antonio Brogi, J...
ICLP
1997
Springer
13 years 11 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...