Neuro-symbolic artificial intelligence: The state of the art

P Hitzler, MK Sarker - 2022 - books.google.com
Neuro-symbolic AI is an emerging subfield of Artificial Intelligence that brings together two
hitherto distinct approaches.” Neuro” refers to the artificial neural networks prominent in …

Conflict-driven clause learning SAT solvers

J Marques-Silva, I Lynce, S Malik - Handbook of satisfiability, 2021 - ebooks.iospress.nl
One of the most important paradigm shifts in the use of SAT solvers for solving industrial
problems has been the introduction of clause learning. Clause learning entails adding a …

Symbolic logic meets machine learning: A brief survey in infinite domains

V Belle - International conference on scalable uncertainty …, 2020 - Springer
The tension between deduction and induction is perhaps the most fundamental issue in
areas such as philosophy, cognition and artificial intelligence (AI). The deduction camp …

Verified proofs of higher-order masking

G Barthe, S Belaïd, F Dupressoir, PA Fouque… - … Conference on the …, 2015 - Springer
In this paper, we study the problem of automatically verifying higher-order masking
countermeasures. This problem is important in practice, since weaknesses have been …

A scalable approximate model counter

S Chakraborty, KS Meel, MY Vardi - Principles and Practice of Constraint …, 2013 - Springer
Abstract Propositional model counting (# SAT), ie, counting the number of satisfying
assignments of a propositional formula, is a problem of significant theoretical and practical …

The model counting competition 2020

JK Fichte, M Hecher, F Hamiti - Journal of Experimental Algorithmics …, 2021 - dl.acm.org
Many computational problems in modern society account to probabilistic reasoning,
statistics, and combinatorics. A variety of these real-world questions can be solved by …

Probabilistic symbolic execution

J Geldenhuys, MB Dwyer, W Visser - Proceedings of the 2012 …, 2012 - dl.acm.org
The continued development of efficient automated decision procedures has spurred the
resurgence of research on symbolic execution over the past decade. Researchers have …

Concolic program repair

R Shariffdeen, Y Noller, L Grunske… - Proceedings of the 42nd …, 2021 - dl.acm.org
Automated program repair reduces the manual effort in fixing program errors. However,
existing repair techniques modify a buggy program such that it passes given tests. Such …

The dichotomy of probabilistic inference for unions of conjunctive queries

N Dalvi, D Suciu - Journal of the ACM (JACM), 2013 - dl.acm.org
We study the complexity of computing a query on a probabilistic database. We consider
unions of conjunctive queries, UCQ, which are equivalent to positive, existential First Order …

Probabilistic inference in hybrid domains by weighted model integration

V Belle, A Passerini, G Van den Broeck - Proceedings of 24th …, 2015 - iris.unitn.it
Weighted model counting (WMC) on a propositional knowledge base is an effective and
general approach to probabilistic inference in a variety of formalisms, including Bayesian …