526 search results - page 38 / 106 » Co-Logic Programming: Extending Logic Programming with Coind... |
ENTCS
2008
13 years 8 months ago
2008
Traditional programming languages are algorithmic: they are best suited to writing programs that acquire all their inputs before executing and only produce a result on termination...
ICLP
2009
Springer
14 years 8 months ago
2009
Springer
We define logic programs with defaults and argumentation theories, a new framework that unifies most of the earlier proposals for defeasible reasoning in logic programming. We pres...
CSL
1995
Springer
13 years 11 months ago
1995
Springer
In this paper we propose to extend the current capabilities of automated reasoning systems by making use of techniques from integer programming. We describe the architecture of an ...
AMAI
2006
Springer
13 years 8 months ago
2006
Springer
In this work, we introduce a new framework able to deal with a reasoning that is at the same time non monotonic and uncertain. In order to take into account a certainty level assoc...
PADL
2005
Springer
14 years 1 months ago
2005
Springer
We describe the design of the OLPS system, an implementation of the preferred answer set semantics for ordered logic programs. The basic algorithm we propose computes the extended ...