Sciweavers

827 search results - page 93 / 166
» Proof-Theoretic Soundness and Completeness
Sort
View
76
Voted
AIPS
2003
15 years 2 months ago
Guided Symbolic Universal Planning
Symbolic universal planning based on the reduced Ordered Binary Decision Diagram (OBDD) has been shown to be an efficient approach for planning in non-deterministic domains. To d...
Rune M. Jensen, Manuela M. Veloso, Randal E. Bryan...
108
Voted
FMOODS
2003
15 years 2 months ago
Inductive Proof Outlines for Monitors in Java
The research concerning Java’s semantics and proof theory has mainly focussed on various aspects of sequential sub-languages. Java, however, integrates features of a class-based ...
Erika Ábrahám, Frank S. de Boer, Wil...
97
Voted
NIPS
2004
15 years 2 months ago
Inference, Attention, and Decision in a Bayesian Neural Architecture
We study the synthesis of neural coding, selective attention and perceptual decision making. We build a hierarchical neural architecture that implements Bayesian integration of no...
Angela J. Yu, Peter Dayan
UAI
2001
15 years 2 months ago
A Calculus for Causal Relevance
We present a sound and complete calculus for causal relevance that uses Pearl's functional causal models as semantics. The calculus consists of axioms and rules of inference ...
Blai Bonet
99
Voted
AAAI
1998
15 years 2 months ago
A Non-Deterministic Semantics for Tractable Inference
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a b c, then c should be an obviou...
James M. Crawford, David W. Etherington