Compacting Boolean Formulae for Inference in Probabilistic Logic Programming

Theofrastos Mantadelis; Dimitar Shterionov; Gerda Janssens

doi:10.1007/978-3-319-23264-5_35

ScienceGate Book Chapters

BOOK-CHAPTER

Compacting Boolean Formulae for Inference in Probabilistic Logic Programming

Theofrastos Mantadelis Dimitar Shterionov Gerda Janssens

Year: 2015 Lecture notes in computer science Pages: 425-438 Publisher: Springer Science+Business Media

DOI: 10.1007/978-3-319-23264-5_35

Get Full-Text PDF Get Analytical Report

Keywords:

Inference Computer science Probabilistic logic Theoretical computer science Boolean expression Boolean model Pipeline (software) Boolean function Algorithm Representation (politics) Time complexity Programming language Artificial intelligence Mathematics Discrete mathematics

Metrics

Cited By

0.91

FWCI (Field Weighted Citation Impact)

Refs

0.75

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Formal Methods in Verification

Physical Sciences → Computer Science → Computational Theory and Mathematics

Logic, Reasoning, and Knowledge

Physical Sciences → Computer Science → Artificial Intelligence

Bayesian Modeling and Causal Inference

Physical Sciences → Computer Science → Artificial Intelligence

Compacting Boolean Formulae for Inference in Probabilistic Logic Programming

Metrics

Citation History

Topics

Related Documents

Probabilistic robotic logic programming with hybrid Boolean and Bayesian inference

MAP Inference for Probabilistic Logic Programming

Approximate Inference for Neural Probabilistic Logic Programming

Hardware verification, Boolean logic programming, Boolean functional programming

Inference and learning in probabilistic logic programs using weighted Boolean formulas