Sciweavers

2303 search results - page 53 / 461
» On the logic of argumentation theory
Sort
View
ECAI
1992
Springer
15 years 10 months ago
Phenomenology, Representations and Complexity
Abstract. The paper refutes the general phenomenological argument that knowledge cannot be completely represented by symbols and, hence, symbolic AI does not work. Moreover, the vi...
Achim G. Hoffmann
MLQ
1998
61views more  MLQ 1998»
15 years 5 months ago
Extracting Algorithms from Intuitionistic Proofs
This paper presents a new method – which does not rely on the cut-elimination theorem – for characterizing the provably total functions of certain intuitionistic subsystems of ...
Fernando Ferreira, António Marques
ENTCS
2006
159views more  ENTCS 2006»
15 years 6 months ago
Approximations of Modal Logic K
Inspired by the recent work on approximating classical logic, we present a procedure that approximates the modal logic K by determining a maximum limit of introspection. This proc...
Guilherme de Souza Rabello, Marcelo Finger
AI
2004
Springer
15 years 6 months ago
Order-sorted logic programming with predicate hierarchy
Order-sorted logic has been formalized as first-order logic with sorted terms where sorts are ordered to build a hierarchy (called a sort-hierarchy). These sorted logics lead to u...
Ken Kaneiwa
ARGMAS
2009
Springer
16 years 23 days ago
Assumption-Based Argumentation for the Minimal Concession Strategy
Abstract. Several recent works in the area of Artificial Intelligence focus on computational models of argumentation-based negotiation. However, even if computational models of ar...
Maxime Morge, Paolo Mancarella