Computing most probable worlds of action probabilistic logic programs: scalable estimation for 1030,000 worlds
- 1 December 2007
- journal article
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 51 (2-4) , 295-331
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Pentagon Asks Academics for Help in Understanding Its EnemiesScience, 2007
- Optimal models of disjunctive logic programs: semantics, complexity, and computationIEEE Transactions on Knowledge and Data Engineering, 2004
- A parametric approach to deductive databases with uncertaintyIEEE Transactions on Knowledge and Data Engineering, 2001
- Coherent Well-founded Annotated Logic ProgramsLecture Notes in Computer Science, 2000
- Heterogeneous active agents, I: SemanticsArtificial Intelligence, 1999
- Probabilisitc Logic Programming under Maximum EntropyLecture Notes in Computer Science, 1999
- Computing non-ground representations of stable models1997
- A logic for reasoning about probabilitiesInformation and Computation, 1990
- Foundations of Logic Programming1987
- Probability logic.Notre Dame Journal of Formal Logic, 1984