Reference health

Many-valued logic and mixed integer programming

https://doi.org/10.1007/bf01530787
CiteStamped reference-health badge
24/24 checkable references clean · checked 2026-09-09

Every reference with a DOI in the deposited reference list resolved to a known work in Crossref or DataCite at the dated check, and none carried a retraction, withdrawal, or removal notice.

26 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.

The 24 checked references that resolve
resolves10.1007/BF00264250
A logic covering undefinedness in program proofs
resolves10.1109/CAIA.1993.366601
Solving 0-1 problems in CLP (PB)
resolves10.1145/137097.137892
Implementing deductive databases by linear programming
resolves10.1145/195613.195637
Mixed integer programming methods for computing nonmonotonic deductive databases
resolves10.1007/BFb0039695
Formal Methods in Programming and Their Applications
resolves10.1007/3-540-52885-7_114
Minimizing the number of clauses by renaming
resolves10.7249/R366
Linear Programming and Extensions
resolves10.1007/978-1-4684-0357-2
First-Order Logic and Automated Theorem Proving
resolves10.1109/ISMVL.1991.130736
Uniform notation of tableau rules for multiple-valued logics
resolves10.1007/BFb0014007
Improving temporal logic tableaux using integer constraints
resolves10.1007/3-540-56944-8_50
Verification of Switch-level designs with many-valued logic
resolves10.1016/0167-9236(88)90097-8
A quantitative approach to logical inference
resolves10.1016/0167-9236(88)90128-5
Computation-oriented reductions of predicate to propositional logic
resolves10.1007/978-1-4684-2001-2_9
Reducibility among Combinatorial Problems
resolves10.1016/S0019-9958(71)90684-X
Some properties of fuzzy logic
resolves10.2307/2268660
A theorem about infinite-valued sentential logic
resolves10.1016/0304-3975(87)90083-1
Satisfiability in many-valued sentential logic is NP-complete
resolves10.2307/2275410
A constructive proof of McNaughton's theorem in infinite-valued logic
resolves10.1007/978-94-011-0215-5_6
A proof of the completeness of the infinite-valued calculus of Łukasiewicz with one variable
resolves10.1007/BF02125899
The deduction theorem for Łukasiewicz many-valued propositional calculi
resolves10.1007/978-3-642-81955-1
Automation of Reasoning
resolves10.1007/978-3-642-86718-7
First-Order Logic
resolves10.1007/978-1-4899-5327-8_25
On the Complexity of Derivation in Propositional Calculus
resolves10.1007/978-94-015-6942-2
Theory of Logical Calculi
The 26 references without a DOI — listed, not checked
no DOI — not checkedM.G. Beavers, Automated theorem proving for ?ukasiewicz logics, Manuscript of talk given at 1991 Meeting of Society for Exact Philosophy, Victoria, Canada, 1991.
no DOI — not checkedM. Broy, C. Facchi, R. Grosu, R. Hettler, H. Hussmann, D. Nazareth, F. Regensburger and K. Stølen, The requirement and design specification language Spectrum, an informal introduction, version 1.0, Technical report, Institut für Informatik, Technische Universität München (1993).
no DOI — not checkedW. Büttner, K. Estenfeld, R. Schmid, H.-A. Schneider and E. Tidén, Symbolic constraint handling through unification in finite algebras, Applicable Algebra in Eng. Commun. Comput. 1 (1990) 97?118.
no DOI — not checkedJ. Czelakowski, Algebraizability of logic and the deduction theorem, Lecture Notes Fourth Summer School on Logic, Language and Information, Colchester/England, 1992.
no DOI — not checkedR. Hähnle, Towards an efficient tableau proof procedure for multiple-valued logics, in:Proc. Workshop on Computer Science Logic, Heidelberg, Springer LNCS 533 (1990) pp. 248?260.
no DOI — not checkedR. Hähnle, A new translation from deduction into integer programming, in: J. Calmet and J.A. Campbell (eds.),Proc. Int. Conf. on Artificial Intelligence and Symbolic mathematical Computing (AISMC-1), Karlsruhe, Germany, Springer LNCS 737 (1992) pp. 262?275.
no DOI — not checkedR. Hähnle, Automated deduction and integer programming, in:Yearbook of the Kurt-Gödel-Society (Kurt-Gödel-Society, Vienna/Austria, 1993).
no DOI — not checkedR. Hähnle,Automated Deduction in Multiple-Valued Logics, Vol. 10 of International Series of Monographs on Computer Science (Oxford University Press, 1993).
no DOI — not checkedR. Hähnle, Short normal forms for arbitrary finitely-valued logics, in:Proc. ISMIS '93, Trondheim, Norway, Springer LNCS 689 (1993) pp. 49?58.
no DOI — not checkedR. Hähnle, Efficient deduction in many-valued logics, in:Proc. Int. Symp. on Multiple-Valued Logics (ISMVL '94), Boston/MA, USA (IEEE Press, Los Alamitos, 1994) pp. 240?249.
no DOI — not checkedJ.N. Hooker and C. Fedjki, Branch-and-cut solution of inference problems in prepositional logic, Ann. Math. AI 1 (1990) 123?139.
no DOI — not checkedJ.N. Hooker, Logical inference and polyhedral projection, in:Proc. Computer Science Logic Workshop 1991, Berne, Springer LNCS 626 (1991), pp. 184?200.
no DOI — not checkedJ.N. Hooker, Generalized resolution for 0?1 linear inequalities, Ann. Math. AI, 6 (1992) 271?286.
no DOI — not checkedJ.N. Hooker, New methods for computing inferences in first order logic, Working Paper, GSIA, CMU Pittsburgh (1992).
no DOI — not checkedR.G. Jeroslow,Logic-Based Decision Support. Mixed Integer Model Formulation (Elsevier, Amsterdam, 1988).
no DOI — not checkedR.G. Jeroslow and J. Wang, Solving propositional satisfiability problems, Ann. Math. AI l (1990) 167?187.
no DOI — not checkedV. Kagan, A. Nerode and V.S. Subrahmanian, Computing definite logic programs by partial instantiation and linear programming, Draft Manuscript (1993).
no DOI — not checkedS.-J. Lee and D.A. Plaisted, Eliminating duplication with the hyperlinking strategy, J. Autom. Reasoning 9 (1992) 25?42.
no DOI — not checkedA. Manuth, Vergleich von Normalformen zu Formeln in ?ukasiewicz Logik, Studienarbeit, Universität Karlsruhe, Fakultät für Informatik (1993).
no DOI — not checkedD. Mundici, The complexity of adaptive error-correcting codes, in:Proc. Workshop Computer Science Logic 90, Heidelberg, Springer LNCS 533 (1990) 300?307.
no DOI — not checkedD. Mundici, Normal forms in infinite-valued logic: The case of one variable, in:Proc. Workshop Computer Science Logic 91, Berne, Springer LNCS 626 (1991) 272?277.
no DOI — not checkedD.A. Plaisted and S.-J. Lee, Inference by clause matching, in: Z. Ras and M. Zemankova (eds.),Intelligent Systems ? State of the Art and Future Directions, chap. 8 (Ellis Horwood, 1990) pp. 200?235.
no DOI — not checkedH. Rasiowa,An Algebraic Approach to Non-Classical Logics, Vol. 78 of Studies in Logic and the Foundations of Mathematics (North-Holland, Amsterdam, 1974).
no DOI — not checkedK. Ries and R. Hähnle, Prädikatenlogische Beweisen mit gemischt gazzahliger Optimierung. Ein tableaubasierter Ansatz, in:Working Notes of Workshop on Artificial Intelligence and Operations Research, Berlin, published as Tech Report, Max-Planck-Institut für Informatik, Saarbrücken (1993).
no DOI — not checkedH. Salkin and K. Mathur,Foundations of Integer Programming (North-Holland, 1989).
no DOI — not checkedN. Zabel, Nouvelles techniques de déduction automatique en logiques polyvalentes finies et infinies du premier ordre, Ph.D. Thesis, Institut National Polytechnique de Grenoble (1993).
What this badge says. CiteStamped means the CHECKABLE references of this work were clean at the dated check: each resolved to a known work in a public registry, and none carried a retraction notice at that time. It says nothing about the quality, findings, or importance of the work itself, and nothing about references deposited without a DOI.

checked 2026-09-09 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record

view as graph · paper page

Embed this badge

Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.

<a href="https://citestamp.com/citestamped/10.1007/bf01530787"><img src="https://citestamp.com/citestamped/10.1007/bf01530787/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[![CiteStamped reference-health badge](https://citestamp.com/citestamped/10.1007/bf01530787/badge.svg)](https://citestamp.com/citestamped/10.1007/bf01530787)