Results 251 to 260 of about 683,469 (288)
Using Orbital Atherectomy in ST-Elevation Myocardial Infarction: A Case Report From a Nonsurgical Centre. [PDF]
Case Rep CardiolBajmmal O, Raju P, Ahmad N, Antoun I.
europepmc +1 more source
Inaccessibility in decision procedures
Inaccessibility in decision proceduresopenaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2009
Chapter 5 introduces into the decision-making procedures. First the notion of decision-making procedure is explained. Then four types of decision-making procedures are distinguished: general heuristic decision-making procedures, specific heuristic decision-making procedures, general analytic decision-making procedures and specific analytic decision ...
Rudolf Grünig, Richard Kühn
openaire +1 more source
Chapter 5 introduces into the decision-making procedures. First the notion of decision-making procedure is explained. Then four types of decision-making procedures are distinguished: general heuristic decision-making procedures, specific heuristic decision-making procedures, general analytic decision-making procedures and specific analytic decision ...
Rudolf Grünig, Richard Kühn
openaire +1 more source
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 2005
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the tree-model property is satisfiable, one constructs an automaton that accepts all (or enough) tree models of the formula and then checks that the language of this automaton is
O. Kupferman, M.Y. Vardi
openaire +1 more source
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the tree-model property is satisfiable, one constructs an automaton that accepts all (or enough) tree models of the formula and then checks that the language of this automaton is
O. Kupferman, M.Y. Vardi
openaire +1 more source
Combining Proof-Producing Decision Procedures
2007Constraint solvers are key modules in many systems with reasoning capabilities (e.g., automated theorem provers). To incorporate constraint solvers in such systems, the capability of producing conflict sets or explanations of their results is crucial. For expressiveness, constraints are usually built out in unions of theories and constraint solvers in ...
Ranise, Silvio +2 more
openaire +2 more sources
2003
We give a detailed survey of the current state-of-the-art methods for combining decision procedures. We review the Nelson-Oppen combination method, Shostak method, and some very recent results on the combination of theories over non-disjoint signatures.
Zohar Manna, Calogero G. Zarba
openaire +1 more source
We give a detailed survey of the current state-of-the-art methods for combining decision procedures. We review the Nelson-Oppen combination method, Shostak method, and some very recent results on the combination of theories over non-disjoint signatures.
Zohar Manna, Calogero G. Zarba
openaire +1 more source
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems, 1979A method for combining decision procedures for several theories into a single decision procedure for their combination is described, and a simplifier based on this method is discussed. The simplifier finds a normal form for any expression formed from individual variables, the usual Boolean connectives, the equality predicate =, the conditional function
Nelson, Greg, Oppen, Derek C.
openaire +2 more sources
1981
In Section 4.2, we define and study invariant procedures. We describe optimal rules in the class of invariant procedures. Various optimality criteria of the goodness of a rule are mentioned. Various selection procedures based on sample values and their ranks are also studied.
Shanti S. Gupta, Deng-Yuan Huang
openaire +1 more source
In Section 4.2, we define and study invariant procedures. We describe optimal rules in the class of invariant procedures. Various optimality criteria of the goodness of a rule are mentioned. Various selection procedures based on sample values and their ranks are also studied.
Shanti S. Gupta, Deng-Yuan Huang
openaire +1 more source