Sciweavers

2303 search results - page 47 / 461
» On the logic of argumentation theory
Sort
View
CSL
2010
Springer
15 years 6 months ago
Randomisation and Derandomisation in Descriptive Complexity Theory
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
Kord Eickmeyer, Martin Grohe
CADE
2006
Springer
16 years 6 months ago
Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach
In this paper, we discuss a lightweight approach to eliminate the overhead due to implicit type arguments during higher-order unification of dependently-typed terms. First, we show...
Brigitte Pientka
COMMA
2006
15 years 7 months ago
Semi-Stable Semantics
In this paper, we examine an argument-based semantics called semi-stable semantics. Semi-stable semantics is quite close to traditional stable semantics in the sense that every st...
Martin Caminada
SIGIR
1998
ACM
15 years 10 months ago
Modeling and Combining Evidence Provided by Document Relationships Using Probabilistic Argumentation Systems
Previous research has shown that hypertext links may be a useful source of evidence for document contents and relevance, but these evidence are rather difficult to represent and co...
Justin Picard
AIML
2008
15 years 7 months ago
Undecidability for arbitrary public announcement logic
Arbitrary public announcement logic (APAL) is an extension of multi-agent epistemic logic that allows agents' knowledge states to be updated by the public announcement of (pos...
Tim French, Hans P. van Ditmarsch