378 search results - page 11 / 76 » Proof interpretations with truth |
97
Voted
CADE
1992
Springer
15 years 5 months ago
1992
Springer
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
100
click to vote
IJCAI
1993
15 years 3 months ago
1993
A student model description language and its synthesis method are presented. The language called SMDL is based on a logic programming language taking 4 truth values such as true, ...
111
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The goal of this lecture is to show how modern theorem provers--in this case, the Coq proof assistant--can be used to mechanize the specification of programming languages and their...
110
Voted
CORR
2011
Springer
14 years 8 months ago
2011
Springer
We give a calculus for reasoning about the first-order fragment of classical logic that is adequate for giving the truth conditions of intuitionistic Kripke frames, and outline a...
116
Voted
IAT
2008
IEEE
15 years 8 months ago
2008
IEEE
We develop strategy/false-name-proof multi-unit auction protocols for non-quasi-linear utilities. One almost universal assumption in auction theory literature is that each bidder ...