Sciweavers

1128 search results - page 27 / 226
» Classical Natural Deduction
Sort
View
AGI
2008
13 years 11 months ago
Comirit: Commonsense Reasoning by Integrating Simulation and Logic
Rich computer simulations or quantitative models can enable an agent to realistically predict real-world behavior with precision and performance that is difficult to emulate in log...
Benjamin Johnston, Mary-Anne Williams
LOGCOM
2010
96views more  LOGCOM 2010»
13 years 8 months ago
The Complexity of the Warranted Formula Problem in Propositional Argumentation
The notion of warrant or justification is one of the central concepts in formal models of argumentation. The dialectical definition of warrant is expressed in terms of recursive...
Robin Hirsch, Nikos Gorogiannis
COLING
2010
13 years 4 months ago
Data-Driven Parsing with Probabilistic Linear Context-Free Rewriting Systems
This paper presents a first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear ContextFree Rewriting Systems (PLCFRS), together with context-summ...
Laura Kallmeyer, Wolfgang Maier
BIRTHDAY
2005
Springer
13 years 11 months ago
History and Future of Implicit and Inductionless Induction: Beware the Old Jade and the Zombie!
Abstract. In this survey on implicit induction I recollect some memories on the history of implicit induction as it is relevant for future research on computer-assisted theorem pro...
Claus-Peter Wirth
RTA
2005
Springer
14 years 3 months ago
Arithmetic as a Theory Modulo
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
Gilles Dowek, Benjamin Werner