Sciweavers

3468 search results - page 154 / 694
» An open logical framework
Sort
View
ENTCS
2008
101views more  ENTCS 2008»
15 years 1 months ago
Normalization for the Simply-Typed Lambda-Calculus in Twelf
Normalization for the simply-typed -calculus is proven in Twelf, an implementation of the Edinburgh Logical Framework. Since due to proof-theoretical restrictions Twelf Tait'...
Andreas Abel
120
Voted
POPL
2010
ACM
15 years 10 months ago
Pure Subtype Systems
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...
DeLesley S. Hutchins
JIIS
2006
93views more  JIIS 2006»
15 years 1 months ago
Measuring inconsistency in knowledgebases
It is well-known that knowledgebases may contain inconsistencies. We provide a measure to quantify the inconsistency of a knowledgebase, thereby allowing for the comparison of the...
John Grant, Anthony Hunter
ML
2006
ACM
122views Machine Learning» more  ML 2006»
15 years 1 months ago
PRL: A probabilistic relational language
In this paper, we describe the syntax and semantics for a probabilistic relational language (PRL). PRL is a recasting of recent work in Probabilistic Relational Models (PRMs) into ...
Lise Getoor, John Grant
136
Voted
WOLLIC
2009
Springer
15 years 7 months ago
Classic-Like Analytic Tableaux for Finite-Valued Logics
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
Carlos Caleiro, João Marcos