Sciweavers

827 search results - page 54 / 166
» Proof-Theoretic Soundness and Completeness
Sort
View
CSL
2002
Springer
13 years 7 months ago
Hoare Logics for Recursive Procedures and Unbounded Nondeterminism
This paper presents sound and complete Hoare logics for partial and total correctness of recursive parameterless procedures in the context of unbounded nondeterminism. For total co...
Tobias Nipkow
JLP
1998
147views more  JLP 1998»
13 years 7 months ago
Automated Reasoning with a Constraint-Based Metainterpreter
Using constraint logic techniques, it is made possible to use a wellknown metainterpreter backwards as a device for generating programs. A metainterpreter is developed, which prov...
Henning Christiansen
ASIACRYPT
2010
Springer
13 years 5 months ago
Short Pairing-Based Non-interactive Zero-Knowledge Arguments
We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero-knowledge and computational soundness. The non-interactive ...
Jens Groth
DLOG
2010
13 years 5 months ago
Orel: Database-Driven Reasoning for OWL 2 Profiles
We describe Orel, a reasoning system for an ontology language which subsumes both the EL and the RL profile of the recently standardised web ontology language OWL 2. Orel performs ...
Markus Krötzsch, Anees Mehdi, Sebastian Rudol...
TGC
2010
Springer
13 years 5 months ago
An Algebra of Hierarchical Graphs
We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: two terms are equated exactly when they represent the same graph. Our algebra can...
Roberto Bruni, Fabio Gadducci, Alberto Lluch-Lafue...