Sciweavers

236 search results - page 17 / 48
» Automated Generation of Interesting Theorems
Sort
View
KR
2010
Springer
14 years 6 days ago
Towards Fixed-Parameter Tractable Algorithms for Argumentation
Abstract argumentation frameworks have received a lot of interest in recent years. Most computational problems in this area are intractable but several tractable fragments have be...
Wolfgang Dvorák, Reinhard Pichler, Stefan W...
LPAR
2001
Springer
13 years 12 months ago
A Local System for Classical Logic
Abstract. The calculus of structures is a framework for specifying logical systems, which is similar to the one-sided sequent calculus but more general. We present a system of infe...
Kai Brünnler, Alwen Fernanto Tiu
TPHOL
1996
IEEE
13 years 11 months ago
Importing Mathematics from HOL into Nuprl
Nuprl and HOL are both tactic-based interactive theorem provers for higher-order logic, and both have been used in many substantial applications over the last decade. However, the ...
Douglas J. Howe
LPAR
2010
Springer
13 years 5 months ago
How to Universally Close the Existential Rule
This paper introduces a nested sequent system for predicate logic. The system features a structural universal quantifier and a universally closed existential rule. One nice conseq...
Kai Brünnler
TAP
2010
Springer
134views Hardware» more  TAP 2010»
13 years 5 months ago
Testing First-Order Logic Axioms in Program Verification
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
Ki Yung Ahn, Ewen Denney