SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Annals of Mathematics and Artificial Intelligence

Volumn 12, Issue 3-4, 1994, Pages 231-263

Many-valued logic and mixed integer programming

(1) Hähnle, Reiner a

a UNIVERSITY OF KARLSRUHE (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21844498602 PISSN: 10122443 EISSN: 15737470 Source Type: Journal
DOI: 10.1007/BF01530787 Document Type: Article

Times cited : (61)

References (50)

1
- 0000058143
- A logic covering undefinedness in program proofs
- (1984) Acta Informatica , vol.21 , pp. 251-269
- Barringer, H.¹ Cheng, J.H.² Jones, C.B.³

2
- 84936015988
- P. Earth and A. Bockmayr, Solving 0–1 problems in CLP(PB), in: Proc. CAIA, Orlando, Florida (IEEE Press, 1993) pp. 263–269.

3
- 84936037456
- M.G. Beavers, Automated theorem proving for Łukasiewicz logics, Manuscript of talk given at 1991 Meeting of Society for Exact Philosophy, Victoria, Canada, 1991.

4
- 84936020252
- C. Bell, A. Nerode, R. Ng and V.S. Subrahmanian, Implementing deductive databases by mixed integer programming, in: Proc. ACM Symp. on Principles of Database Systems, 1992, pp. 283–292.

5
- 84935996344
- C. Bell, A. Nerode, R. Ng and V.S. Subrahmanian, Mixed integer programming methods for computing nonmonotonic deductive databases, JACM (1994) to appear.

6
- 84936036276
- D. Bjørner, M. Broy and I.V. Pottosin (eds.), Formal Methods in Programming and Their Applications, Vol. 735 of Lecture Notes in Computer Science (Springer, 1993).

7
- 84936022665
- Th.B. de la Tour, Minimizing the number of clauses by renaming, in: M.E. Stickel (ed.), Proc. 10th Int. Conf. on Automated Deduction, Kaiserslautern, LNCS 449 (Springer, 1990) pp. 558–572.

8
- 84936053931
- M. 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).

9
- 0346669529
- Symbolic constraint handling through unification in finite algebras, Applicable Algebra in Eng
- (1990) Commun. Comput. , vol.1 , pp. 97-118
- Büttner, W.¹ Estenfeld, K.² Schmid, R.³ Schneider, H.-A.⁴ Tidén, E.⁵

10
- 84936059121
- J. Czelakowski, Algebraizability of logic and the deduction theorem, Lecture Notes Fourth Summer School on Logic, Language and Information, Colchester/England, 1992.

11
- 84936000265
- G.B. Dantzig, Linear Programming and Extensions (Princeton University Press, 1963).

12
- 0003631434
- Springer, New York
- (1990) First-Order Logic and Automated Theorem Proving
- Fitting, M.C.¹

13
- 84936039555
- R. 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.

14
- 84936028838
- R. Hähnle, Uniform notation of tableaux rules for multiple-valued logics, in: Proc. Int. Symp. on Multiple-valued Logic, Victoria, (IEEE Press, 1991) pp. 238–245.

15
- 84935996451
- R. 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.

16
- 84936049609
- Automated deduction and integer programming
- Kurt-Gödel-Society, Vienna/Austria
- (1993) Yearbook of the Kurt-Gödel-Society
- Hähnle, R.¹

17
- 84936020244
- R. Hähnle, Automated Deduction in Multiple-Valued Logics, Vol. 10 of International Series of Monographs on Computer Science (Oxford University Press, 1993).

18
- 84935999790
- R. Hähnle, Short normal forms for arbitrary finitely-valued logics, in: Proc. ISMIS '93, Trondheim, Norway, Springer LNCS 689 (1993) pp. 49–58.

19
- 0027989213
- Proc. Int. Symp. on Multiple-Valued Logics (ISMVL '94), Boston/MA, USA, IEEE Press, Los Alamitos
- (1994) Efficient deduction in many-valued logics , pp. 240-249
- Hähnle, R.¹

20
- 84936022979
- R. Hähnle and O. Ibens, Improving temporal logic tableaux using integer constraints, in: Proc. Int. Conf. on Temporal Logic, Bonn, Germany, Springer LNCS 827 (1994) pp. 535–539.

21
- 84935997211
- R. Hähnle and W. Kernig, Verification of switch level designs with many-valued logic, in: A. Voronkov (ed.) Proc. LPAR '93, St. Petersburg, Springer LNAI 698 (1993) pp. 158–169.

22
- 0000675599
- Branch-and-cut solution of inference problems in prepositional logic
- (1990) Ann. Math. AI , vol.1 , pp. 123-139
- Hooker, J.N.¹ Fedjki, C.²

23
- 0003077519
- A quantitative approach to logical inference
- (1988) Decision Support Syst. , vol.4 , pp. 45-69
- Hooker, J.N.¹

24
- 84936002510
- J.N. Hooker, Logical inference and polyhedral projection, in: Proc. Computer Science Logic Workshop 1991, Berne, Springer LNCS 626 (1991), pp. 184–200.

25
- 0042576324
- Generalized resolution for 0–1 linear inequalities
- (1992) Ann. Math. AI , vol.6 , pp. 271-286
- Hooker, J.N.¹

26
- 84936049282
- New methods for computing inferences in first order logic
- CMU, Pittsburgh
- (1992) Working Paper, GSIA
- Hooker, J.N.¹

27
- 38249029088
- Computation-oriented reductions of predicate to prepositional logic
- (1988) Decision Support Syst. , vol.4 , pp. 183-187
- Jeroslow, R.G.¹

28
- 0004297627
- Elsevier, Amsterdam
- (1988) Logic-Based Decision Support. Mixed Integer Model Formulation
- Jeroslow, R.G.¹

29
- 0000234006
- Solving propositional satisfiability problems
- (1990) Ann. Math. , vol.50 AI , pp. 167-187
- Jeroslow, R.G.¹ Wang, J.²

30
- 84936036435
- V. Kagan, A. Nerode and V.S. Subrahmanian, Computing definite logic programs by partial instantiation and linear programming, Draft Manuscript (1993).

31
- 84936038938
- R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller and J.W. Thatcher (eds.), Complexity of Computer Computations (Plenum Press, 1972) 85–103.

32
- 0005339748
- Some properties of fuzzy logic
- (1971) Information and Control , vol.19 , pp. 417-431
- Lee, R.C.T.¹ Chang, C.-L.²

33
- 0003019709
- Eliminating duplication with the hyperlinking strategy
- (1992) J. Autom. Reasoning , vol.9 , pp. 25-42
- Lee, S.-J.¹ Plaisted, D.A.²

34
- 84936024893
- A. Manuth, Vergleich von Normalformen zu Formeln in Łukasiewicz Logik, Studienarbeit, Universität Karlsruhe, Fakultät für Informatik (1993).

35
- 0002141730
- A theorem about infinite-valued sentential logic
- (1951) J. Symb. Logic , vol.16 , pp. 1-13
- McNaughton, R.¹

36
- 0023537271
- Satisfiability in many-valued sentential logic is NP-complete
- (1987) Theor. Comp. Sci. , vol.52 , pp. 145-153
- Mundici, D.¹

37
- 84935993820
- D. Mundici, The complexity of adaptive error-correcting codes, in: Proc. Workshop Computer Science Logic 90, Heidelberg, Springer LNCS 533 (1990) 300–307.

38
- 84936047961
- D. 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.

39
- 0001230644
- A constructive proof of McNaughton's theorem in infinite-valued logic
- (1994) J. Symb. Logic , vol.59 , pp. 596-602
- Mundici, D.¹

40
- 84936008429
- D. Mundici and M. Pasquetto, A proof of the completeness of the infinite-valued calculus of Łukasiewicz with one variable, in: E.P. Klement and U. Hoehle (eds.) Proc. Int. Conf. on Nonclassical Logics and their Applications, 1992 Linz, Austria (Kluwer, 1994).

41
- 84936058866
- D.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.

42
- 0003612373
- The deduction theorem for Łukasiewicz many-valued propositional calculi
- (1964) Studia Logica , vol.15 , pp. 7-23
- Pogorzelski, W.A.¹

43
- 0040753780
- An Algebraic Approach to Non-Classical Logics
- North-Holland, Amsterdam
- (1974) Vol. 78 of Studies in Logic and the Foundations of Mathematics
- Rasiowa, H.¹

44
- 84935998953
- Working Notes of Workshop on Artificial Intelligence and Operations Research, Berlin, Max-Planck-Institut für Informatik, Saarbrücken
- (1993) Prädikatenlogische Beweisen mit gemischt gazzahliger Optimierung. Ein tableaubasierter Ansatz
- Ries, K.¹ Hähnle, R.²

45
- 84936023927
- H. Salkin and K. Mathur, Foundations of Integer Programming (North-Holland, 1989).

46
- 84936021875
- J. Siekmann and G. Wrightson (eds.), Automation of Reasoning: Classical Papers in Computational Logic 1967–1970, Vol. 2 (Springer, 1983).

47
- 0003631438
- Springer, New York
- (1968) First-Order Logic
- Smullyan, R.¹

48
- 84936015323
- G. Tseitin, On the complexity of proofs in propositional logics, Seminars in Mathematics, 8 (1970), reprinted in [46].

49
- 0003582355
- Reidel, Dordrecht
- (1988) Theory of Logical Calculi
- Wójcicki, R.¹

50
- 84935994273
- N. 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).

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.