3053 search results - page 311 / 611 » A Logic of Abstract Argumentation |
148
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
Abstract. We present randoCoP, a theorem prover for classical firstorder logic, which integrates randomized search techniques into the connection prover leanCoP 2.0. By randomly re...
170
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
Abstract. The LogAnswer system is an application of automated reasoning to the field of open domain question-answering, the retrieval of answers to natural language questions regar...
232
Voted
MKM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Formal verification of numerical programs is notoriously difficult. On the one hand, there exist automatic tools specialized in floatingpoint arithmetic, such as Gappa...
166
click to vote
EPIA
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. The two puzzles are the Lottery Paradox and the Amalgamation Paradox, which both point out difficulties for aggregating uncertain information. A generalization of the lot...
220
click to vote
ACL2
2006
ACM
16 years 24 days ago
2006
ACM
ACL2 is used to systematically study domains whose elements can be “uniquely” factored into products of “irreducible” elements. The best known examples of such domains are...