Results 61 to 70 of about 12,229,216 (240)
Finding Minimum‐Cost Explanations for Predictions Made by Tree Ensembles
Software: Practice and Experience, EarlyView.ABSTRACT The ability to reliably explain why a machine learning model arrives at a particular prediction is crucial when used as decision support by human operators of critical systems. The provided explanations must be provably correct, and preferably without redundant information, called minimal explanations.
John Törnblom +2 more
wiley +1 more source
A Deletion Algorithm for the Marginal Problem in Propositional Logic Based on Boolean Arrays
Mathematics, 2023 This paper proposes a deletion algorithm for the marginal problem in propositional logic. The algorithm is based on the general Davis and Putnam deletion algorithm DP, expressed as a bucket elimination algorithm, representing sets of clauses with the ...
Efraín Díaz-Macías, Serafín Moral
doaj +1 more source
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC [PDF]
, 2010 The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIME-complete in the presence of unrestricted axioms.
Meier, Arne, Schneider, Thomas
core +1 more source
Catalan satisfiability problem
, 2013 An and/or tree is usually a binary plane tree, with internal nodes labelled by logical connectives, and with leaves labelled by literals chosen in a fixed set of k variables and their negations. In the present paper, we introduce the first model of such Catalan trees, whose number of variables k_n is a function of n, the size of the expressions.
Genitrini, Antoine, Mailler, Cécile
openaire +2 more sources
Generalized Satisfiability Problems via Operator Assignments [PDF]
Journal of Computer and System Sciences, 2017 Schaefer introduced a framework for generalized satisfiability problems on the Boolean domain and characterized the computational complexity of such problems. We investigate an algebraization of Schaefer's framework in which the Fourier transform is used to represent constraints by multilinear polynomials in a unique way.
Atserias, Albert +2 more
openaire +5 more sources
Noûs, EarlyView.ABSTRACT It is a truism of mathematics that differences between isomorphic number systems are irrelevant to arithmetic. This truism is deeply rooted in the modern axiomatic method and underlies most strands of arithmetical structuralism, the view that arithmetic is about some abstract number structure.
Balthasar Grabmayr
wiley +1 more source
An Efficient Steady-State Analysis Method for Large Boolean Networks with High Maximum Node Connectivity. [PDF]
PLoS ONE, 2015 Boolean networks have been widely used to model biological processes lacking detailed kinetic information. Despite their simplicity, Boolean network dynamics can still capture some important features of biological systems such as stable cell phenotypes ...
Changki Hong +3 more
doaj +1 more source
Generating hard satisfiability problems
Artificial Intelligence, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Selman, Bart +2 more
openaire +2 more sources
A Contextual Accuracy Dominance Argument for Probabilism
Philosophy and Phenomenological Research, EarlyView.ABSTRACT A central motivation for Probabilism—the principle of rationality that requires one to have credences that satisfy the axioms of probability—is the accuracy dominance argument: one should not have accuracy dominated credences, and one avoids accuracy dominance just in case one satisfies Probabilism.
Mikayla Kelley
wiley +1 more source
On the probabilistic approach to the random satisfiability problem
, 2003 In this note I will review some of the recent results that have been obtained in the probabilistic approach to the random satisfiability problem. At the present moment the results are only heuristic.
Parisi, Giorgio
core +2 more sources