28 search results - page 5 / 6 » Proof search and Co-NP completeness for many-valued logics |
FUIN
2007
13 years 5 months ago
2007
We present a resolution calculus for first-order logic using a more concise formalism for representing sets of clauses. The idea is to represent the clause set at hand as a Direct...
TLCA
2005
Springer
13 years 10 months ago
2005
Springer
αProlog is a logic programming language which is well-suited for rapid prototyping of type systems and operational semantics of typed λ-calculi and many other languages involving...
POPL
2006
ACM
14 years 5 months ago
2006
ACM
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
ATAL
2000
Springer
13 years 9 months ago
2000
Springer
In this paper we propose a methodology to help analyse tendencies in MAS to complement those of simple inspection, Monte Carlo and syntactic proof. We suggest an architecture that ...
RTA
2005
Springer
13 years 10 months ago
2005
Springer
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...