Sciweavers

Share
848 search results - page 2 / 170
» Proof-Theoretic Soundness and Completeness
Sort
View
RELMICS
2015
Springer
3 years 3 months ago
Completeness and Incompleteness in Nominal Kleene Algebra
Gabbay and Ciancia (2011) presented a nominal extension of Kleene algebra as a framework for trace semantics with statically scoped allocation of resources, along with a semantics ...
Dexter Kozen, Konstantinos Mamouras, Alexandra Sil...
FLOPS
2008
Springer
8 years 8 months ago
Formalizing a Constraint Deductive Database Language Based on Hereditary Harrop Formulas with Negation
In this paper, we present an extension of the scheme HH(C) (Hereditary Harrop formulas with Constraints) with a suitable formulation of negation in order to obtain a constraint ded...
Susana Nieva, Jaime Sánchez-Hernánde...
FASE
2010
Springer
9 years 1 months ago
Proving Consistency and Completeness of Model Classes Using Theory Interpretation
Abstract. Abstraction is essential in the formal specification of programs. A common way of writing abstract specifications is to specify implementations in terms of basic mathem...
Ádám Darvas, Peter Müller
LICS
2012
IEEE
6 years 9 months ago
The Complete Proof Theory of Hybrid Systems
—Hybrid systems are a fusion of continuous dynamical systems and discrete dynamical systems. They freely combine dynamical features from both worlds. For that reason, it has ofte...
André Platzer
RTA
2015
Springer
3 years 3 months ago
No complete linear term rewriting system for propositional logic
Recently it has been observed that the set of all sound linear inference rules in propositional logic is already coNP-complete, i.e. that every boolean tautology can be written as...
Anupam Das, Lutz Straßburger
books