Sciweavers

140 search results - page 25 / 28
» Logic Programming, Abduction and Probability
Sort
View
ILP
2007
Springer
14 years 4 months ago
Learning to Assign Degrees of Belief in Relational Domains
A recurrent question in the design of intelligent agents is how to assign degrees of beliefs, or subjective probabilities, to various events in a relational environment. In the sta...
Frédéric Koriche
ILP
2007
Springer
14 years 4 months ago
Combining Clauses with Various Precisions and Recalls to Produce Accurate Probabilistic Estimates
Statistical Relational Learning (SRL) combines the benefits of probabilistic machine learning approaches with complex, structured domains from Inductive Logic Programming (ILP). W...
Mark Goadrich, Jude W. Shavlik
CSL
2007
Springer
14 years 4 months ago
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
Dale Miller, Alexis Saurin
CEC
2011
IEEE
12 years 9 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
IEEEPACT
2007
IEEE
14 years 4 months ago
Error Detection Using Dynamic Dataflow Verification
Continued scaling of CMOS technology to smaller transistor sizes makes modern processors more susceptible to both transient and permanent hardware faults. Circuitlevel techniques ...
Albert Meixner, Daniel J. Sorin