Sciweavers

3481 search results - page 125 / 697
» Higher-Order Logic Programming as Constraint Logic Programmi...
Sort
View
ECSQARU
2005
Springer
15 years 3 months ago
A Possibilistic Inconsistency Handling in Answer Set Programming
Abstract. Both in classical logic and in Answer Set Programming, inconsistency is characterized by non existence of a model. Whereas every formula is a theorem for inconsistent set...
Pascal Nicolas, Laurent Garcia, Igor Stépha...
ECAI
2008
Springer
14 years 11 months ago
Advanced Preprocessing for Answer Set Solving
Abstract. We introduce the first substantial approach to preprocessing in the context of answer set solving. The idea is to simplify a logic program while identifying equivalences ...
Martin Gebser, Benjamin Kaufmann, André Neu...
INFSOF
1998
88views more  INFSOF 1998»
14 years 9 months ago
A logic based language for networked agents
This paper presents a logic based language, SAFIN, for developing networked software agents. It integrates agent-oriented programming, KQML and basic mobile techniques to support ...
Dianxiang Xu
POPL
2008
ACM
15 years 10 months ago
Cyclic proofs of program termination in separation logic
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...
FOSSACS
1999
Springer
15 years 2 months ago
A Strong Logic Programming View for Static Embedded Implications
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...
R. Arruabarrena, Paqui Lucio, Marisa Navarro