MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Logic programs with annotated disjunctions." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

10 documents found, showing 1 through 10.

ATOM

Logic programs with annotated disjunctions
by Joost Vennekens, Sofie Verbaeten, Maurice Bruynooghe, Celestijnenlaan A — 2004 — In Proc. Int’l Conf. on Logic Programming
… Logic Programs with Annotated Disjunctions Joost Vennekens, Sofie Verbaeten? and Maurice…
Cited by 19 (4 self) – Add To MetaCart

Learning logic programs with annotated disjunctions
by Fabrizio Riguzzi — 2004 — 14th Internation Conference on Inductive Logic Programming (ILP2004
…Learning Logic Programs with Annotated Disjunctions Fabrizio Riguzzi Dipartimento di Ingegneria…
Cited by 8 (2 self) – Add To MetaCart

Two novel methods for learning logic programs with annotated disjunctions
by Hendrik Blockeel — 2006 — In Proceedings of the 16th International Conference on Inductive Logic Programming
…Two Novel Methods for Learning Logic Programs with Annotated Disjunctions Hendrik Blockeel…
Cited by 1 (0 self) – Add To MetaCart

ALLPAD: Approximate learning of logic programs with annotated disjunctions (Tech. Rep
by Fabrizio Riguzzi — 2006
…ALLPAD: Approximate Learning of Logic Programs with Annotated Disjunctions Fabrizio Riguzzi…
Cited by 1 (1 self) – Add To MetaCart

Celestijnenlaan 200A – B-3001 Heverlee (Belgium) On the equivalence between CP-logic
by Joost Vennekens, Marc Denecker, Maurice Bruynooghe, Lpads, Joost Vennekens, Marc Denecker, Maurice Bruynooghe — 2008
… Programs with Annotated Disjunctions (LPADs) (6) and CP-logic (5) are equivalent. Before moving…
Add To MetaCart

W.: Towards learning non-recursive LPADs by transforming them into Bayesian networks
by Hendrik Blockeel, Wannes Meert — 2007 — International Conference on Inductive Logic Programming. (2006
… Leuven, Belgium Abstract. Logic programs with annotated disjunctions, or LPADs, are an elegant knowledge…
Cited by 2 (1 self) – Add To MetaCart

Representing Causal Information about a Probabilistic Process
by Joost Vennekens, Marc Denecker, Maurice Bruynooghe
… language of Logic Programs with Annotated Disjunctions [12], which is known to have strong ties to Poole…
Cited by 1 (1 self) – Add To MetaCart

Probabilistic logical models for mendel’s experiments: An exercise
by Hendrik Blockeel — 2004 — In Inductive Logic Programming (ILP 2004), Work in Progress Track
….4 LPAD’s Logic programs with annotated disjunctions (LPAD’s) [5] have been designed from the knowledge…
Cited by 2 (0 self) – Add To MetaCart

M.: Extending the role of causality in probabilistic modeling
by Joost Vennekens, Marc Denecker, Maurice Bruynooghe — 2006 — In: Proceedings of the 11th International Workshop on Non-monotonic Reasoning. (2006) 183–190
…,7) · · · win 0 0 1 0 0 0 · · · lose 0 0 0 0 0 1 · · · Logic Programs with Annotated Disjunctions Logic Programs…
Cited by 3 (0 self) – Add To MetaCart

S.: First-order probabilistic languages: Into the unknown
by Brian Milch, Stuart Russell — 2007 — Proceedings of the 16th International Conference on Inductive Logic Programming. (2007
… include probabilistic Horn abduction [27], independent choice logic [28] and logic programs with annotated…
Cited by 6 (0 self) – Add To MetaCart

Showing 1 through 10.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB