dblp.uni-trier.dewww.uni-trier.de

Marc Bezem Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
41EEJohn Fisher, Marc Bezem: Skolem Machines. Fundam. Inform. 91(1): 79-103 (2009)
2008
40EEMarc Bezem, Robert Nieuwenhuis, Enric Rodríguez-Carbonell: The Max-Atom Problem and Its Relevance. LPAR 2008: 47-61
39EEMarc Bezem, Robert Nieuwenhuis, Enric Rodríguez-Carbonell: Exponential behaviour of the Butkovic-Zimmermann algorithm for solving two-sided linear systems in max-algebra. Discrete Applied Mathematics 156(18): 3506-3509 (2008)
38EEMarc Bezem, Dimitri Hendriks: On the Mechanization of the Proof of Hessenberg's Theorem in Coherent Logic. J. Autom. Reasoning 40(1): 61-85 (2008)
2007
37EEJohn Fisher, Marc Bezem: Skolem Machines and Geometric Logic. ICTAC 2007: 201-215
36EEMarc Bezem, Tore Langholm, Michal Walicki: Completeness and Decidability in Sequence Logic. LPAR 2007: 123-137
35EEJohn Fisher, Marc Bezem: Query Completeness of Skolem Machine Computations. MCU 2007: 182-192
2005
34EEHoang Truong, Marc Bezem: Finding Resource Bounds in the Presence of Explicit Deallocation. ICTAC 2005: 227-241
33EEMarc Bezem, Thierry Coquand: Automating Coherent Logic. LPAR 2005: 246-260
32EEMarc Bezem: On the Undecidability of Coherent Logic. Processes, Terms and Cycles 2005: 6-13
2004
31EEMarc Bezem, Hoang Truong: A Type System for the Safe Instantiation of Components. Electr. Notes Theor. Comput. Sci. 97: 197-217 (2004)
2003
30 Marc Bezem, Thierry Coquand: Newman's lemma - a case study in proof automation and geometric logic, Logic in Computer Science Column. Bulletin of the EATCS 79: 86-100 (2003)
29EETore Langholm, Marc Bezem: A Descriptive Characterisation of Even Linear Languages. Grammars 6(3): 169-181 (2003)
2002
28 Marc Bezem, Dimitri Hendriks, Hans de Nivelle: Automated Proof Construction in Type Theory Using Resolution. J. Autom. Reasoning 29(3-4): 253-275 (2002)
2001
27EEMarc Bezem: An Improved Extensionality Criterion for Higher-Order Logic Programs. CSL 2001: 203-216
2000
26EEMarc Bezem, Dimitri Hendriks, Hans de Nivelle: Automated Proof Construction in Type Theory Using Resolution. CADE 2000: 148-163
1999
25 Marc Bezem: Extensionality of Simply Typed Logic Programs. ICLP 1999: 395-410
1998
24EEKrzysztof R. Apt, Marc Bezem: Formulas as Programs CoRR cs.LO/9811017: (1998)
23 Marc Bezem, Jan Willem Klop, Vincent van Oostrom: Diagram Techniques for Confluence. Inf. Comput. 141(2): 172-204 (1998)
22 Stefano Berardi, Marc Bezem, Thierry Coquand: On the Computational Content of the Axiom of Choice. J. Symb. Log. 63(2): 600-622 (1998)
1997
21 Dirk van Dalen, Marc Bezem: Computer Science Logic, 10th International Workshop, CSL '96, Annual Conference of the EACSL, Utrecht, The Netherlands, September 21-27, 1996, Selected Papers Springer 1997
20 Marc Bezem, Roland N. Bol, Jan Friso Groote: Formalizing Process Algebraic Verifications in the Calculus of Constructions. Formal Asp. Comput. 9(1): 1-48 (1997)
19EEMarc Bezem, Alban Ponse: Two Finite Specifications of a Queue. Theor. Comput. Sci. 177(2): 487-507 (1997)
1996
18 Erik Barendsen, Marc Bezem: Polymorphic Extensions of Simple Type Structures - With an Application to Bar Recursive Minimization. Ann. Pure Appl. Logic 79(3): 221-280 (1996)
17 Marc Bezem, Jan Springintveld: A Simple Proof of the Undecidability of Inhabitation in lambdaP. J. Funct. Program. 6(5): 757-761 (1996)
1995
16 Stefano Berardi, Marc Bezem, Thierry Coquand: A realization of the negative interpretation of the Axiom of Choice. TLCA 1995: 47-62
1994
15EEMarc Bezem, Jan Friso Groote: Invariants in Process Algebra with Data. CONCUR 1994: 401-416
14 Marc Bezem, Jan Friso Groote: A Correctness Proof of a One-Bit Sliding Window Protocol in µCRL. Comput. J. 37(4): 289-307 (1994)
13 Marc Bezem, Jan Keuzenkamp: Undecidable Goals for Completed Acyclic Programs. New Generation Comput. 12(2): 209-213 (1994)
1993
12 Marc Bezem, Jan Friso Groote: Typed Lambda Calculi and Applications, International Conference on Typed Lambda Calculi and Applications, TLCA '93, Utrecht, The Netherlands, March 16-18, 1993, Proceedings Springer 1993
11 Marc Bezem: Strong Termination of Logic Programs. J. Log. Program. 15(1&2): 79-97 (1993)
1991
10 Marc Bezem: Semantics and Consistency of Rule-Based Expert Systems. J. Log. Comput. 1(4): 477-495 (1991)
9 Krzysztof R. Apt, Marc Bezem: Acyclic Programs. New Generation Comput. 9(3/4): 335-364 (1991)
1990
8 Krzysztof R. Apt, Marc Bezem: Acyclic Programs. ICLP 1990: 617-633
7 Marc Bezem: Completeness of Resolution Revisited. Theor. Comput. Sci. 74(2): 227-237 (1990)
1989
6 Marc Bezem: Characterizing Termination of Logic Programs with Level Mappings. NACLP 1989: 69-80
5 Marc Bezem: Compact and Majorizable Functionals of Finite Type. J. Symb. Log. 54(1): 271-280 (1989)
1988
4EEMarc Bezem: Consistency of Rule-based Expert System. CADE 1988: 151-161
3 Marc Bezem, Jan van Leeuwen: On Estimating the Complexity of Logarithmic Decompositions. Inf. Process. Lett. 26(6): 321-324 (1988)
1985
2 Marc Bezem: Isomorphisms Between HEO and HROE, ECF and ICFE. J. Symb. Log. 50(2): 359-371 (1985)
1 Marc Bezem: Strongly Majorizable Functionals of Finite Type: A Model for Barrecursion Containing Discontinuous Functionals. J. Symb. Log. 50(3): 652-660 (1985)

Coauthor Index

1Krzysztof R. Apt [8] [9] [24]
2Erik Barendsen [18]
3Stefano Berardi [16] [22]
4Roland N. Bol [20]
5Thierry Coquand [16] [22] [30] [33]
6Dirk van Dalen [21]
7John Fisher [35] [37] [41]
8Jan Friso Groote [12] [14] [15] [20]
9Dimitri Hendriks [26] [28] [38]
10Jan Keuzenkamp [13]
11Jan Willem Klop [23]
12Tore Langholm [29] [36]
13Jan van Leeuwen [3]
14Robert Nieuwenhuis [39] [40]
15Hans de Nivelle [26] [28]
16Vincent van Oostrom [23]
17Alban Ponse [19]
18Enric Rodríguez-Carbonell [39] [40]
19Jan Springintveld [17]
20Hoang Truong [31] [34]
21Michal Walicki [36]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)