- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| 47 |      | Marc Bezem, Clemens Grabmayer, Michal Walicki: Expressive power of digraph solvability. Ann. Pure Appl. Logic 163(3): 200-213 (2012) |
| 2011 | ||
| 46 |  | Marc Bezem: Computer Science Logic, 25th International Workshop / 20th Annual Conference of the EACSL, CSL 2011, September 12-15, 2011, Bergen, Norway, Proceedings Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2011 |
| 45 | | Keiko Nakata, Tarmo Uustalu, Marc Bezem: A Proof Pearl with the Fan Theorem and Bar Induction - Walking through Infinite Trees with Mixed Induction and Coinduction. APLAS 2011: 353-368 |
| 2010 | ||
| 44 | | Marc Bezem, Robert Nieuwenhuis, Enric Rodríguez-Carbonell: Hard problems in max-algebra, control theory, hypergraphs and other areas. Inf. Process. Lett. 110(4): 133-138 (2010) |
| 2009 | ||
| 43 | | John Fisher, Marc Bezem: Skolem Machines. Fundam. Inform. 91(1): 79-103 (2009) |
| 42 | | Michal Walicki, Marc Bezem, Wojtek Szajnkenig: Developing Bounded Reasoning. Journal of Logic, Language and Information 18(1): 97-129 (2009) |
| 2008 | ||
| 41 | | Marc Bezem, Robert Nieuwenhuis, Enric Rodríguez-Carbonell: The Max-Atom Problem and Its Relevance. LPAR 2008: 47-61 |
| 40 | | Marc 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) |
| 39 | | Marc 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 | ||
| 38 | | John Fisher, Marc Bezem: Skolem Machines and Geometric Logic. ICTAC 2007: 201-215 |
| 37 | | Marc Bezem, Tore Langholm, Michal Walicki: Completeness and Decidability in Sequence Logic. LPAR 2007: 123-137 |
| 36 | | John Fisher, Marc Bezem: Query Completeness of Skolem Machine Computations. MCU 2007: 182-192 |
| 2005 | ||
| 35 | | Hoang Truong, Marc Bezem: Finding Resource Bounds in the Presence of Explicit Deallocation. ICTAC 2005: 227-241 |
| 34 | | Marc Bezem, Thierry Coquand: Automating Coherent Logic. LPAR 2005: 246-260 |
| 33 | | Marc Bezem: On the Undecidability of Coherent Logic. Processes, Terms and Cycles 2005: 6-13 |
| 2004 | ||
| 32 | | Marc Bezem, Hoang Truong: A Type System for the Safe Instantiation of Components. Electr. Notes Theor. Comput. Sci. 97: 197-217 (2004) |
| 31 | | Marc Bezem, Christian Sloper, Tore Langholm: Black Box and White Box Identification of Formal Languages Using Test Sets. Grammars 7: 111-123 (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) |
| 29 | | Tore 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 | ||
| 27 | | Marc Bezem: An Improved Extensionality Criterion for Higher-Order Logic Programs. CSL 2001: 203-216 |
| 2000 | ||
| 26 | | Marc 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 | ||
| 24 | | Krzysztof 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) |
| 19 | | Marc 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 | ||
| 15 | | Marc 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 | ||
| 4 | | Marc 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) |
| 1 | Krzysztof R. Apt | [8] [9] [24] |
| 2 | Erik Barendsen | [18] |
| 3 | Stefano Berardi | [16] [22] |
| 4 | Roland N. Bol | [20] |
| 5 | Thierry Coquand | [16] [22] [30] [34] |
| 6 | Dirk van Dalen | [21] |
| 7 | John Fisher | [36] [38] [43] |
| 8 | Clemens Grabmayer | [47] |
| 9 | Jan Friso Groote | [12] [14] [15] [20] |
| 10 | Dimitri Hendriks | [26] [28] [39] |
| 11 | Jan Keuzenkamp | [13] |
| 12 | Jan Willem Klop | [23] |
| 13 | Tore Langholm | [29] [31] [37] |
| 14 | Jan van Leeuwen | [3] |
| 15 | Keiko Nakata | [45] |
| 16 | Robert Nieuwenhuis | [40] [41] [44] |
| 17 | Hans de Nivelle | [26] [28] |
| 18 | Vincent van Oostrom | [23] |
| 19 | Alban Ponse | [19] |
| 20 | Enric Rodríguez-Carbonell | [40] [41] [44] |
| 21 | Christian Sloper | [31] |
| 22 | Jan Springintveld | [17] |
| 23 | Wojtek Szajnkenig | [42] |
| 24 | Hoang Truong | [32] [35] |
| 25 | Tarmo Uustalu | [45] |
| 26 | Michal Walicki | [37] [42] [47] |
Colors in the list of coauthors
Last update Thu May 24 01:13:30 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page