177 search results - page 16 / 36 » Extending Conceptual Logic Programs with Arbitrary Rules |
ICLP
2005
Springer
14 years 1 months ago
2005
Springer
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
ECAI
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. The agent programming language GOLOG and the underlying Situation Calculus have become popular means for the modelling and control of autonomous agents such as mobile rob...
ICLP
2003
Springer
14 years 21 days ago
2003
Springer
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...
LPNMR
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. We consider the simplification of logic programs under the stablemodel semantics, with respect to the notions of strong and uniform equivalence between logic programs, r...
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
We show how to reason about “step-indexed” logitions in an abstract way, avoiding the tedious, error-prone, and proof-obscuring step-index arithmetic that seems superficially...