Sciweavers

115 search results - page 11 / 23
» Decision Problems for Propositional Linear Logic
Sort
View
EDM
2010
165views Data Mining» more  EDM 2010»
13 years 8 months ago
Using a Bayesian Knowledge Base for Hint Selection on Domain Specific Problems
A Bayesian Knowledge Base is a generalization of traditional Bayesian Networks where nodes or groups of nodes have independence. In this paper we describe a method of generating a ...
John C. Stamper, Tiffany Barnes, Marvin J. Croy
ICTCS
2003
Springer
14 years 17 days ago
On the Computational Complexity of Cut-Elimination in Linear Logic
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
Harry G. Mairson, Kazushige Terui
FSTTCS
2009
Springer
14 years 1 months ago
Automata and temporal logic over arbitrary linear time
Linear temporal logic was introduced in order to reason about reactive systems. It is often considered with respect to infinite words, to specify the behaviour of long-running sys...
Julien Cristau
STACS
1993
Springer
13 years 11 months ago
The Complexity of Logic-Based Abduction
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
Thomas Eiter, Georg Gottlob
LICS
2006
IEEE
14 years 1 months ago
Managing Digital Rights using Linear Logic
Digital music players protect songs by enforcing licenses that convey specific rights for individual songs or groups of songs. For licenses specified in industry, we show that d...
Adam Barth, John C. Mitchell