Results 261 to 270 of about 3,768,784 (298)
Some of the next articles are maybe not open access.
A Framework for Cooperating Decision Procedures
2000We present a flexible framework for cooperating decision procedures. We describe the properties needed to ensure correctness and show how it can be applied to implement an efficient version of Nelson and Oppen’s algorithm for combining decision procedures. We also show how a Shostak style decision procedure can be implemented in the framework in such a
Clark W. Barrett +2 more
openaire +2 more sources
Bayes Burn-In Decision Procedures
Probability in the Engineering and Informational Sciences, 1990The burn-in problem is reframed in a decision-making context. The role of the predictive life distribution in the burn-in decision problem is highlighted. The case in which the predictive distribution is a mixture of exponentials is discussed extensively.
Clarotti, C. A., Spizzichino, F.
openaire +1 more source
Symbolic Decision Procedures for QBF
2004Much recent work has gone into adapting techniques that were originally developed for SAT solving to QBF solving. In particular, QBF solvers are often based on SAT solvers. Most competitive QBF solvers are search-based. In this work we explore an alternative approach to QBF solving, based on symbolic quantifier elimination.
Guoqiang Pan, Moshe Y. Vardi
openaire +2 more sources
Turning decision procedures into disprovers
Mathematical Logic Quarterly, 2008AbstractA class of many‐sorted polyadic set algebras is introduced. These generalise structure and model in a way that is relevant in regards to the Entscheidungsproblem and to automated reasoning.A downward Löwenheim‐Skolem property is shown in that each satisfiable finite conjunction of purely relational first‐order prenex sentences has a finite ...
openaire +2 more sources
Theory of Probability & Its Applications, 1976
Klimov, G. P., Kuz'min, A. D.
openaire +2 more sources
Klimov, G. P., Kuz'min, A. D.
openaire +2 more sources
Decision Procedure for an Extension of WS1S
2001We define an extension of the weak monadic second-order logic of one successor (WS1S) with an infinite family of relations and show its decidability. Analogously to the decision procedure for WS1S, automata are used. But instead of using word automata, we use tree automata that accept or reject words.
openaire +2 more sources
The Impact of Using Algorithms for Managerial Decisions on Public Employees' Procedural Justice
Government Information Quarterly, 2021Rosanna Nagtegaal
exaly
Decision procedure for autoepistemic logic
2005Autoepistemic logic is a nonmonotonic logic for modeling the beliefs of an ideally rational agent who reflects on his own beliefs. Autoepistemic logic has been lacking a decision procedure to answer the question: given a set of premises describing the beliefs of an agent does the agent believe a given formula (is the given formula derivable from the ...
openaire +1 more source
Decision Aids for Localized Prostate Cancer Treatment Choice: Systematic Review and Meta-Analysis
Ca-A Cancer Journal for Clinicians, 2015Arnav Agarwal +2 more
exaly
What Is Lacking in Current Decision Aids on Cancer Screening?
Ca-A Cancer Journal for Clinicians, 2013Sarah T Hawley +2 more
exaly

