2303 search results - page 108 / 461 » On the logic of argumentation theory |
172
click to vote
AAAI
1990
15 years 7 months ago
1990
An algorithm is described which computes stable models of propositional logic programs with negation as failure using the Assumption Based Truth Maintenance mechanism. Since stabl...
182
click to vote
JUCS
2006
15 years 6 months ago
2006
: Our aim is to discuss what, when and, how deep logic should be taught in the computer science education in connection with the so called "Bologna process". We survey th...
206
click to vote
ACL2
2006
ACM
15 years 10 months ago
2006
ACM
We investigate the logical issues behind axiomatizing equations that contain both recursive calls and quantifiers in ACL2. We identify a class of such equations, named extended ta...
147
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical co...
170
click to vote
LICS
1999
IEEE
15 years 10 months ago
1999
IEEE
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...