Sciweavers

1101 search results - page 43 / 221
» Forcing in proof theory
Sort
View
AGP
2010
IEEE
14 years 3 months ago
Proof-Theoretic and Higher-Order Extensions of Logic Programming
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstr...
Alberto Momigliano, Mario Ornaghi
AAAI
2010
13 years 11 months ago
A Temporal Proof System for General Game Playing
A general game player is a system that understands the rules of unknown games and learns to play these games well without human intervention. A major challenge for research in Gen...
Michael Thielscher, Sebastian Voigt
FMOODS
2003
13 years 11 months ago
Inductive Proof Outlines for Monitors in Java
The research concerning Java’s semantics and proof theory has mainly focussed on various aspects of sequential sub-languages. Java, however, integrates features of a class-based ...
Erika Ábrahám, Frank S. de Boer, Wil...
CIE
2008
Springer
13 years 12 months ago
Succinct NP Proofs from an Extractability Assumption
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
Giovanni Di Crescenzo, Helger Lipmaa
SAC
2010
ACM
13 years 4 months ago
Similar triangles and orientation in plane elementary geometry for Coq-based proofs
In plane elementary geometry, the concept of similar triangles not only forms an important foundation for trigonometry, but it also can be used to solve many geometric problems. T...
Tuan Minh Pham