2909 search results - page 125 / 582 » Consistency of the theory of contexts |
186
click to vote
KI
1990
Springer
15 years 10 months ago
1990
Springer
ue to a lack of abstraction in the formalization of deductive mechanisms involved in programming reasoning tools for the development of program synthesizers are not yet available. ...
170
click to vote
CL
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We consider the problem of specifying and computing consistent answers to queries against databases that do not satisfy given integrity constraints. This is done by simul...
161
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...
198
click to vote
LICS
2007
IEEE
16 years 19 days ago
2007
IEEE
In predicate logic, the proof that a theorem P holds in a theory Th is typically conducted in natural deduction or in the sequent calculus using all the information contained in t...
157
click to vote
JIIS
2008
15 years 6 months ago
2008
We propose a natural framework, called NF, which supports development of formal proofs on a computer. NF is based on a theory of Judgments and Derivations. NF is designed by observ...