3053 search results - page 72 / 611 » A Logic of Abstract Argumentation |
149
click to vote
PEPM
2007
ACM
16 years 15 days ago
2007
ACM
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
176
click to vote
AMAI
2006
Springer
15 years 6 months ago
2006
Springer
We show that the concepts of strong and uniform equivalence of logic programs eneralized to an abstract algebraic setting of operators on complete lattices. Our results imply char...
151
click to vote
SYNASC
2007
IEEE
16 years 20 days ago
2007
IEEE
Abstract. In this paper we give some applications of weakly Picard operators theory to linear positive approximation operators, to difference equations with deviating argument and...
164
click to vote
CADE
2001
Springer
16 years 6 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
140
click to vote
JURIX
2008
15 years 7 months ago
2008
This paper extends our previous logical analysis of presumptions and burden of proof by studying the force of a presumption once counterevidence has been offered. In the jurisprude...