Sciweavers

1269 search results - page 118 / 254
» Pi-Calculus in Logical Form
Sort
View
UAI
1993
15 years 6 months ago
Probabilistic Assumption-Based Reasoning
In this paper the classical propositional assumption-based model is extended to incorporate probabilities for the assumptions. Then the whole model is placed into the framework of...
Jürg Kohlas, Paul-André Monney
AAMAS
2008
Springer
15 years 5 months ago
Dynamic intention structures I: a theory of intention representation
This article introduces a new theory of intention representation which is based1 on a structure called a Dynamic Intention Structure (DIS). The theory of DISs was motivated2 by the...
Luke Hunsberger, Charles L. Ortiz Jr.
CORR
2010
Springer
151views Education» more  CORR 2010»
15 years 5 months ago
Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
Zachary Snow, David Baelde, Gopalan Nadathur
130
Voted
CORR
2008
Springer
137views Education» more  CORR 2008»
15 years 5 months ago
Combining generic judgments with recursive definitions
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
Andrew Gacek, Dale Miller, Gopalan Nadathur
JANCL
2007
74views more  JANCL 2007»
15 years 5 months ago
Operations on proofs and labels
Logic of proofs LP introduced by S. Artemov in 1995 describes properties of proof predicate “t is a proof of F” in the propositional language extended by atoms of the form [[t...
Tatiana Yavorskaya, Natalia Rubtsova