Gerard R. Renardel de Lavalette

dblp:r/GRRenardeldeLavalette · DBLP profile ↗
← Back
14ranked-venue papers
8as first author
1since 2021 · last 2026
0000-0002-9045-8941ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 11 · 7 first-author · 1 since 2021Artificial intelligence and machine learning · 3 · 1 first-authorDatabases, data management, data science and information retrieval · 1
YearPublicationVenuePosition
2026 Proving interpolation for conditional equational logic, using functions to represent conditionals
Gerard R. Renardel de Lavalette
Ann. Pure Appl. Log.1
2018 Interpolation in propositional Horn logic
abstract
In this paper we give an abstract representation of propositional Horn logic (finite or infinitary) in terms of set-valued functions |${\mathcal F} : \wp (\mathsf {PR}) \rightarrow \wp (\mathsf {PR})$|⁠; here PR is the collection of atomic propositions. We investigate the properties of set-valued functions and establish that they satisfy the axioms of weak lazy Kleene algebra. These axioms and other properties are used to prove uniform left interpolation for propositional Horn logic. Then we introduce thin set-valued functions, which enable us to prove polynomial interpolation for propositional Horn logic. For the infinite case, the Axiom of Choice is used.
Gerard R. Renardel de Lavalette
J. Log. Comput.1
2012 Intuitionistic implication without disjunction
abstract
We investigate fragments of intuitionistic propositional logic containing implication but not disjunction. These fragments are finite, but their size grows superexponentially with the number of generators. Exact models are used to characterize the fragments.
Gerard R. Renardel de Lavalette, Lex Hendriks, Dick de Jongh
J. Log. Comput.1
2012 Finite and infinite implementation of transition systems
Wim H. Hesselink, Gerard R. Renardel de Lavalette
Theor. Comput. Sci.2
2006 Hybrid Logics with Infinitary Proof Systems
abstract
We provide a strongly complete infinitary proof system for hybrid logic. This proof system can be extended with countably many sequents. Thus, although these logics may be non-compact, strong completeness proofs are provided for infinitary hybrid versions of non-compact logics like ancestral logic and Segerberg's modal logic with the bounded chain condition. This extends the completeness result for hybrid logics by Gargov, Passy, and Tinchev.
Barteld P. Kooi, Gerard R. Renardel de Lavalette, Rineke Verbrugge
J. Log. Comput.2
2004 Knowledge-Based Asynchronous Programming
Hendrik Wietze de Haan, Wim H. Hesselink, Gerard R. Renardel de Lavalette
Fundam. Informaticae3
2004 Changing Modalities
abstract
The dynamic modal logic DML is presented, featuring actions that change the interpretation of a propositional variable or a modality. The semantics is defined both in terms of modal structures and of labelled transition systems (Kripke models). The extension µDML with recursively defined actions aims to unify and extend dynamic epistemic logics proposed by Plaza, Gerbrandy, Baltag, Van Ditmarsch and others. The main technical result is the completeness and decidability of µDML.
Gerard R. Renardel de Lavalette
J. Log. Comput.1
1998 Modal Change Logic (MCL): Specifying the Reasoning of Knowledge-Based Systems
Dieter Fensel, Rix Groenboom, Gerard R. Renardel de Lavalette
Data Knowl. Eng.3
1997 Formalisation for decision support in anaesthesiology
Gerard R. Renardel de Lavalette, Rix Groenboom, Ernest Rotterdam, Frank van Harmelen, Annette ten Teije, Fred de Geus
Artif. Intell. Medicine1
1992 Strictness Analysis via Abstract Interpretation for Recursively Defined Types
Gerard R. Renardel de Lavalette
Inf. Comput.1
1991 Query Optimization Using Rewrite Rules
Sieger van Denneheuvel, Karen L. Kwast, Gerard R. Renardel de Lavalette, Edith Hemaspaandra
RTA3
1991 Computations in Fragments of Intuitionistic Propositional Logic
Dick de Jongh, Lex Hendriks, Gerard R. Renardel de Lavalette
J. Autom. Reason.3
1990 Extended Bar Induction in Applicative Theories
Gerard R. Renardel de Lavalette
Ann. Pure Appl. Log.1
1989 Interpolation in Fragments of Intuitionistic Propositional Logic
abstract
Abstract We show in this paper that all fragments of intuitionistic propositional logic based on a subset of the connectives ∧, ∨, →, ¬ satisfy interpolation. Fragments containing ↔ or ¬¬ are briefly considered.
Gerard R. Renardel de Lavalette
J. Symb. Log.1