SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Marc Bezem: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

Krzysztof R. Apt, Marc Bezem
Acyclic Programs. [Citation Graph (5, 0)][DBLP]
ICLP, 1990, pp:617-633 [Conf]
Marc Bezem
Characterizing Termination of Logic Programs with Level Mappings. [Citation Graph (1, 0)][DBLP]
NACLP, 1989, pp:69-80 [Conf]
Marc Bezem
On the Undecidability of Coherent Logic. [Citation Graph (0, 0)][DBLP]
Processes, Terms and Cycles, 2005, pp:6-13 [Conf]
Marc Bezem
Consistency of Rule-based Expert System. [Citation Graph (0, 0)][DBLP]
CADE, 1988, pp:151-161 [Conf]
Marc Bezem, Dimitri Hendriks, Hans de Nivelle
Automated Proof Construction in Type Theory Using Resolution. [Citation Graph (0, 0)][DBLP]
CADE, 2000, pp:148-163 [Conf]
Marc Bezem, Jan Friso Groote
Invariants in Process Algebra with Data. [Citation Graph (0, 0)][DBLP]
CONCUR, 1994, pp:401-416 [Conf]
Marc Bezem
An Improved Extensionality Criterion for Higher-Order Logic Programs. [Citation Graph (0, 0)][DBLP]
CSL, 2001, pp:203-216 [Conf]
Marc Bezem
Extensionality of Simply Typed Logic Programs. [Citation Graph (0, 0)][DBLP]
ICLP, 1999, pp:395-410 [Conf]
Hoang Truong, Marc Bezem
Finding Resource Bounds in the Presence of Explicit Deallocation. [Citation Graph (0, 0)][DBLP]
ICTAC, 2005, pp:227-241 [Conf]
Marc Bezem, Thierry Coquand
Automating Coherent Logic. [Citation Graph (0, 0)][DBLP]
LPAR, 2005, pp:246-260 [Conf]
Stefano Berardi, Marc Bezem, Thierry Coquand
A realization of the negative interpretation of the Axiom of Choice. [Citation Graph (0, 0)][DBLP]
TLCA, 1995, pp:47-62 [Conf]
Erik Barendsen, Marc Bezem
Polymorphic Extensions of Simple Type Structures - With an Application to Bar Recursive Minimization. [Citation Graph (0, 0)][DBLP]
Ann. Pure Appl. Logic, 1996, v:79, n:3, pp:221-280 [Journal]
Marc Bezem, Jan Friso Groote
A Correctness Proof of a One-Bit Sliding Window Protocol in µCRL. [Citation Graph (0, 0)][DBLP]
Comput. J., 1994, v:37, n:4, pp:289-307 [Journal]
Krzysztof R. Apt, Marc Bezem
Formulas as Programs [Citation Graph (0, 0)][DBLP]
CoRR, 1998, v:0, n:, pp:- [Journal]
Marc Bezem, Thierry Coquand
Newman's lemma - a case study in proof automation and geometric logic, Logic in Computer Science Column. [Citation Graph (0, 0)][DBLP]
Bulletin of the EATCS, 2003, v:79, n:, pp:86-100 [Journal]
Marc Bezem, Hoang Truong
A Type System for the Safe Instantiation of Components. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 2004, v:97, n:, pp:197-217 [Journal]
Marc Bezem, Roland N. Bol, Jan Friso Groote
Formalizing Process Algebraic Verifications in the Calculus of Constructions. [Citation Graph (0, 0)][DBLP]
Formal Asp. Comput., 1997, v:9, n:1, pp:1-48 [Journal]
Tore Langholm, Marc Bezem
A Descriptive Characterisation of Even Linear Languages. [Citation Graph (0, 0)][DBLP]
Grammars, 2003, v:6, n:3, pp:169-181 [Journal]
Marc Bezem, Jan Willem Klop, Vincent van Oostrom
Diagram Techniques for Confluence. [Citation Graph (0, 0)][DBLP]
Inf. Comput., 1998, v:141, n:2, pp:172-204 [Journal]
Marc Bezem, Jan van Leeuwen
On Estimating the Complexity of Logarithmic Decompositions. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1988, v:26, n:6, pp:321-324 [Journal]
Marc Bezem, Dimitri Hendriks, Hans de Nivelle
Automated Proof Construction in Type Theory Using Resolution. [Citation Graph (0, 0)][DBLP]
J. Autom. Reasoning, 2002, v:29, n:3-4, pp:253-275 [Journal]
Marc Bezem, Jan Springintveld
A Simple Proof of the Undecidability of Inhabitation in lambdaP. [Citation Graph (0, 0)][DBLP]
J. Funct. Program., 1996, v:6, n:5, pp:757-761 [Journal]
Marc Bezem
Strong Termination of Logic Programs. [Citation Graph (0, 0)][DBLP]
J. Log. Program., 1993, v:15, n:1&2, pp:79-97 [Journal]
Stefano Berardi, Marc Bezem, Thierry Coquand
On the Computational Content of the Axiom of Choice. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1998, v:63, n:2, pp:600-622 [Journal]
Marc Bezem
Isomorphisms Between HEO and HROE, ECF and ICFE. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1985, v:50, n:2, pp:359-371 [Journal]
Marc Bezem
Strongly Majorizable Functionals of Finite Type: A Model for Barrecursion Containing Discontinuous Functionals. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1985, v:50, n:3, pp:652-660 [Journal]
Marc Bezem
Compact and Majorizable Functionals of Finite Type. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1989, v:54, n:1, pp:271-280 [Journal]
Marc Bezem
Semantics and Consistency of Rule-Based Expert Systems. [Citation Graph (0, 0)][DBLP]
J. Log. Comput., 1991, v:1, n:4, pp:477-495 [Journal]
Krzysztof R. Apt, Marc Bezem
Acyclic Programs. [Citation Graph (0, 0)][DBLP]
New Generation Comput., 1991, v:9, n:3/4, pp:335-364 [Journal]
Marc Bezem, Jan Keuzenkamp
Undecidable Goals for Completed Acyclic Programs. [Citation Graph (0, 0)][DBLP]
New Generation Comput., 1994, v:12, n:2, pp:209-213 [Journal]
Marc Bezem
Completeness of Resolution Revisited. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1990, v:74, n:2, pp:227-237 [Journal]
Marc Bezem, Alban Ponse
Two Finite Specifications of a Queue. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1997, v:177, n:2, pp:487-507 [Journal]
John Fisher, Marc Bezem
Skolem Machines and Geometric Logic. [Citation Graph (0, 0)][DBLP]
ICTAC, 2007, pp:201-215 [Conf]
Marc Bezem, Tore Langholm, Michal Walicki
Completeness and Decidability in Sequence Logic. [Citation Graph (0, 0)][DBLP]
LPAR, 2007, pp:123-137 [Conf]
John Fisher, Marc Bezem
Query Completeness of Skolem Machine Computations. [Citation Graph (0, 0)][DBLP]
MCU, 2007, pp:182-192 [Conf]
The Max-Atom Problem and Its Relevance. [Citation Graph (, )][DBLP]
Exponential behaviour of the Butkovic-Zimmermann algorithm for solving two-sided linear systems in max-algebra. [Citation Graph (, )][DBLP]

Search in 0.037secs, Finished in 0.039secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP