Sciweavers

393 search results - page 10 / 79
» Logic Programs with Classical Negation
Sort
View
CIE
2006
Springer
13 years 11 months ago
Understanding and Using Spector's Bar Recursive Interpretation of Classical Analysis
This note reexamines Spector's remarkable computational interpretation of full classical analysis. Spector's interpretation makes use of a rather abstruse recursion schem...
Paulo Oliva
LPKR
1997
Springer
13 years 11 months ago
Disjunctive Logic Programming and Autoepistemic Logic
In this paper, we use autoepistemic reasoning semantics to classify various semantics for disjunctive logic programs with default negation. We have observed that two different typ...
Li-Yan Yuan, Jia-Huai You, Randy Goebel
ENTCS
2002
157views more  ENTCS 2002»
13 years 7 months ago
Arguments and Misunderstandings: Fuzzy Unification for Negotiating Agents
In this paper, we develop the notion of fuzzy unification and incorporate it into a novel fuzzy argumentation framework for extended logic programming. We make the following contri...
Michael Schroeder, Ralf Schweimeier
CSL
2009
Springer
14 years 1 months ago
Focalisation and Classical Realisability
We develop a polarised variant of Curien and Herbelin’s ¯λµ˜µ calculus suitable for sequent calculi that admit a focalising cut elimination (i.e. whose proofs are focalised ...
Guillaume Munch-Maccagnoni
KR
1994
Springer
13 years 11 months ago
REVISE: An Extended Logic Programming System for Revising Knowledge Bases
In this paper we describe REVISE, an extended logic programming system for revising knowledge bases. REVISE is based on logic programming with explicit negation, plus a two-valued...
Carlos Viegas Damásio, Wolfgang Nejdl, Lu&i...