Sciweavers

4192 search results - page 404 / 839
» Probabilistic Logic Programming
Sort
View
ENTCS
2007
107views more  ENTCS 2007»
15 years 5 months ago
Event Domains, Stable Functions and Proof-Nets
We pursue the program of exposing the intrinsic mathematical structure of the “space of proofs” of a logical system [AJ94b]. We study the case of Multiplicative-Additive Linea...
Samson Abramsky
CORR
2002
Springer
169views Education» more  CORR 2002»
15 years 4 months ago
On the existence and multiplicity of extensions in dialectical argumentation
In the present paper, the existence and multiplicity problems of extensions are addressed. The focus is on extension of the stable type. The main result of the paper is an elegant...
Bart Verheij
JLP
1998
147views more  JLP 1998»
15 years 4 months ago
Automated Reasoning with a Constraint-Based Metainterpreter
Using constraint logic techniques, it is made possible to use a wellknown metainterpreter backwards as a device for generating programs. A metainterpreter is developed, which prov...
Henning Christiansen
DAC
1996
ACM
15 years 9 months ago
Hot-Carrier Reliability Enhancement via Input Reordering and Transistor Sizing
Hot-carrier eects and electromigration are the two important failure mechanisms that signi cantly impact the long-term reliability of high-density VLSI ICs. In this paper, we prese...
Aurobindo Dasgupta, Ramesh Karri
133
Voted
UAI
1989
15 years 6 months ago
Can Uncertainty Management be Realized in a Finite Totally Ordered Probability Algebra?
In this paper, the feasibility of using finite totally ordered probability models under Aleliunas’s Theory of Probabilistic Logic [Aleliunas, 1988] is investigated. The general...
Yang Xiang, Michael P. Beddoes, David Poole