Sciweavers

93 search results - page 8 / 19
» From Disjunctive Programs to Abduction
Sort
View
ML
2008
ACM
150views Machine Learning» more  ML 2008»
14 years 9 months ago
Learning probabilistic logic models from probabilistic examples
Abstract. We revisit an application developed originally using Inductive Logic Programming (ILP) by replacing the underlying Logic Program (LP) description with Stochastic Logic Pr...
Jianzhong Chen, Stephen Muggleton, José Car...
105
Voted
DLOG
2009
14 years 7 months ago
Formalizing Multimedia Interpretation based on Abduction over Description Logic Aboxes
Abstract. The paper describes how interpretations of multimedia documents can be formally derived using abduction over domain knowledge represented in an ontology. The approach use...
Irma Sofia Espinosa Peraldi, Atila Kaya, Ralf M&ou...
JLP
2000
134views more  JLP 2000»
14 years 9 months ago
Abducing through negation as failure: stable models within the independent choice logic
The independent choice logic (ICL) is part of a project to combine logic and decision/game theory into a coherent framework. The ICL has a simple possible-worlds semantics charact...
David Poole
CADE
2006
Springer
15 years 10 months ago
Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics
Church's Higher Order Logic is a basis for proof assistants -- HOL and PVS. Church's logic has a simple set-theoretic semantics, making it trustworthy and extensible. We ...
Robert L. Constable, Wojciech Moczydlowski
CPAIOR
2010
Springer
15 years 1 months ago
An In-Out Approach to Disjunctive Optimization
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
Matteo Fischetti, Domenico Salvagnin