Exploration
Accueil
Racine
Exploration
Accueil
Racine

Serveur d'exploration sur la recherche en informatique en Lorraine

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Le cluster paramodulation - resolution

Terms

10paramodulation
24resolution
49automated deduction
55term rewriting
19lambda calculus
39rewriting calculus
20type theory
8logics

Associations

Freq.WeightAssociation
88paramodulation - resolution
77automated deduction - term rewriting
77automated deduction - resolution
77lambda calculus - rewriting calculus
66rewriting calculus - type theory
66rewriting calculus - term rewriting
66logics - type theory
Documents par ordre de pertinence
00C468 (1995) Michael Rusinowitch ; Laurent VigneronAutomated Deduction with Associative Commutative Operators
00D248 (1993) Michaël Rusinowitch [France] ; Laurent Vigneron [France]Automated deduction with associative commutative operators
007F90 (2002-07-21) Horatiu Cirstea [France] ; Claude Kirchner [France] ; Luigi Liquori [France] ; Benjamin Wack [France]The rho cube : some results, some problems
008135 (2002) Benjamin WackAspects typés du calcul de réécriture
008189 (2002) Horatiu Cirstea ; Claude Kirchner ; Luigi Liquori ; Benjamin WackThe rho cube : some results, some problems
008618 (2002) Quang Huy Nguyen ; Claude Kirchner ; Hélène KirchnerExternal rewriting for skeptical proof assistants (extended version)
008B44 (2002) Quang-Huy Nguyen [France] ; Claude Kirchner [France] ; Hélène Kirchner [France]External rewriting for skeptical proof assistants (extended version)
00A252 (2000) Florent Jacquemard [France] ; Michaël Rusinowitch [France] ; Laurent VigneronCompiling and Verifying Security Protocols
00CA64 (1994) Laurent VigneronAssociative-Commutative Deduction with Constraints
00D758 (1991) A. BouhoulaPreuve automatique par paramodulation, réécriture et induction
002003 (2011-11-14) Laurent Vigneron [France]Automated Deduction applied to the Analysis and Verification of Infinite State Systems
004852 (2007-06-29) Oana Andrei [France] ; Hélène Kirchner [France]A Rewriting Calculus for Multigraphs with Ports
005158 (2006-04-01) Horatiu Cirstea [France] ; Clement Houtmann [France] ; Benjamin Wack [France]Distributive Rho-Calculus
006B40 (2004) Horatiu Cirstea [France] ; Luigi Liquori [France] ; Benjamin Wack [France]Rewriting Calculus with Fixpoints: Untyped and First-Order Systems
007556 (2003) Clara Bertolissi ; Horatiu Cirstea ; Claude KirchnerTranslating Combinatory Reduction Systems into the Rewriting Calculus
007D46 (2003) Harald Ganzinger ; Jürgen Stuber [France]Superposition with Equivalence Reasoning andDelayed Clause Normal Form Transformation
008184 (2002) Quang Huy NguyenCalcul de réécriture et automatisation du raisonnement dans les assistants de preuve
008291 (2002) Horatiu Cirstea ; Claude Kirchner ; Luigi LiquoriRewriting Calculus with(out) Types
008635 (2002) Quang Huy Nguyen ; Claude Kirchner ; Hélène KirchnerExternal rewriting for skeptical proof assistants
008804 (2002) Quang Huy Nguyen ; Claude Kirchner ; Hélène KirchnerExternal Rewriting for Skeptical Proof Assistants
008D86 (2001) Horatiu Cirstea ; Claude Kirchner ; Luigi LiquoriThe Rho Cube
008F95 (2001) Yannick Chevalier ; Laurent VigneronTowards Efficient Automated Verification of Security Protocols
009011 (2001) Yannick Chevalier ; Laurent VigneronA Tool for Lazy Verification of Security Protocols
009102 (2001) Claude Kirchner ; Zhebin Qian ; Preet Kamal Singh ; Jürgen StuberXemantics : a Rewriting Calculus-Based Semantics of XSLT
009541 (2001) Alessandro Armando ; Silvio Ranise [France] ; Michaël Rusinowitch [France]Uniform Derivation of Decision Procedures by Superposition
009B52 (2000) Didier Galmiche ; David PymProof-search in Type-theoretic Languages : An Introduction
009C22 (2000) Workshop on Type-theoretic Languages : Proof-search and Semantics
009C43 (2000) Didier Galmiche ; David PymTheoretical Computer Science - Special issue on Proof search in Type-theoretic Languages
009D18 (2000) Didier Galmiche [France] ; David J. Pym [Royaume-Uni]Proof-search in type-theoretic languages: an introduction
00A122 (2000) Didier Galmiche [France] ; David PymTheoretical Computer Science - Special issue on Proof search in Type-theoretic Languages
00A635 (1999) Peter Borovansky ; Claude Kirchner ; Hélène Kirchner ; Christophe RingeissenRewriting with strategies in ELAN : a functional semantics
00C911 (1994) Laurent VigneronDéduction automatique avec contraintes symboliques dans les théories équationnelles
00CB80 (1994) Laurent VigneronSuperposition in AC Theories : Proof of Completeness by Semantic Trees
00DB15 (1990) Laurent VigneronDéduction automatique dans des théories associatives-commutatives
00E158 (1988) D. GalmicheThe Power of Constructive Framework for Program Synthesis
00E192 (1988) M. RusinowitchTheorem-proving with Resolution and Superposition : An Extension of Knuth and Bendix Procedure as a Complete Set of Inference Rules.
00E410 (1987) M. RusinowitchDémonstration automatique par des techniques de réécriture
00E490 (1987) M. RusinowitchTheorem-proving with resolution and superposition : an extension of Knuth and Bendix procedure as a complete set of inference rules
000614 (2015-03-09) Emilie Balland [France] ; Horatiu Cirstea [France] ; Pierre-Etienne Moreau [France]Bringing Strategic Rewriting into the Mainstream
000E23 (2014) Emilie Balland [France] ; Pierre-Etienne Moreau [France] ; Antoine Reilles [France]Effective strategic programming for Java developers
001271 (2013-03-21) Philippe Beaucamps [France] ; Isabelle Gnaedig [France] ; Jean-Yves Marion [France]Behavior Analysis of Malicious Code by Weighted Behavior Abstraction
001955 (2012-09-10) Philippe Beaucamps [France] ; Isabelle Gnaedig [France] ; Jean-Yves Marion [France]Abstraction-based Malware Analysis Using Rewriting and Model Checking
002351 (2011-05-19) Philippe Beaucamps [France] ; Isabelle Gnaedig [France] ; Jean-Yves Marion [France]Behavior Analysis of Malware by Rewriting-based Abstraction - Extended Version
002380 (2011-05-01) Claude Kirchner [France] ; Helene Kirchner [France] ; Fabrice Nahon [France]Narrowing Based Inductive Proof Search
002708 (2011) Maxime Amblard [France]Encoding Phases Using Commutativity and Non-commutativity in a Logical Framework
002894 (2010-12-17) Philippe Beaucamps [France] ; Isabelle Gnaedig [France] ; Jean-Yves Marion [France]Abstraction by Term Rewriting for Malware Behavior Analysis - Extended Version
002D97 (2010-03-12) Clément Houtmann [France]Representation and interaction of proofs in superdeduction modulo
003669 (2009-03-22) Oana Andrei [Royaume-Uni] ; Helene Kirchner [France]A Port Graph Calculus for Autonomic Computing and Invariant Verification
003919 (2009) Philippe De Groote [France] ; Sylvain Pogodalla [France] ; Carl Pollard [États-Unis]On the Syntax-Semantics Interface: From Convergent Grammar to Abstract Categorial Grammar
003D71 (2008-11-05) Oana Andrei [France]A Rewriting Calculus for Graphs: Applications to Biology and Autonomous Systems
003E53 (2008-09-08) Frédéric Blanqui [République populaire de Chine] ; Jean-Pierre Jouannaud [France] ; Pierre-Yves Strub [France]From formal proofs to mathematical proofs: a safe, incremental way for building in first-order decision procedures
004014 (2008-05-09) Guillaume Burel [France]Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
004075 (2008-03-03) Oana Andrei [France] ; Hélène Kirchner [France]Strategic Port Graph Rewriting for Autonomic Computing
004688 (2007-10-25) Fabrice Nahon [France]Proof by induction in sequent calculus modulo
004709 (2007-10-05) Patrick Blackburn [France] ; Sébastien Hinderer [France]From TY_n to DRT: an implementation
004721 (2007-09-27) Patrick Blackburn [France] ; Sébastien Hinderer [France]Generating models for temporal representations
004724 (2007-09-26) Oana Andrei [France] ; Hélène Kirchner [France]Graph Rewriting and Strategies for Modeling Biochemical Networks
004A79 (2007) Horatiu Cirstea [France] ; Germain Faure [France] ; Claude Kirchner [France]A Rho-Calculus of explicit constraint application
004B67 (2007) Clara Bertolissi [France] ; Claude Kirchner [France]The Rewriting Calculus as a Combinatory Reduction System
005446 (2006) Evelyne Contejean [France] ; Claude Marché [France] ; Ana Paula Tomás [Portugal] ; Xavier Urbain [France]Mechanically Proving Termination Using Polynomial Interpretations
005870 (2005-10-28) Clara Bertolissi [France]The graph rewriting calculus: properties and expressive capabilities
005968 (2005-07-11) Claude Kirchner [France] ; Pierre-Etienne Moreau [France] ; Antoine Reilles [France]Formal Validation of Pattern Matching Code
005C37 (2005) Frédéric Blanqui [France]Inductive types in the Calculus of Algebraic Constructions
005C52 (2005) Paolo Baldan [Italie] ; Clara Bertolissi [France] ; Horatiu Cirstea [France] ; Claude Kirchner [France]A rewriting calculus for cyclic higher-order term graphs
005E28 (2005) Paolo Baldan ; Clara Bertolissi ; Horatiu Cirstea ; Claude KirchnerA rewriting calculus for cyclic higher-order term graphs
005E71 (2005) Germain Faure ; Claude Kirchner ; Horatiu CirsteaA Rho-Calculus of explicit constraint application
005E81 (2005) Claude Kirchner ; Pierre-Étienne Moreau ; Antoine ReillesFormal Validation of Pattern Matching Code
006114 (2005) Frédéric Blanqui [France]Definitions by rewriting in the Calculus of Constructions
006290 (2005) Chuck Liang [États-Unis] ; Gopalan Nadathur [États-Unis] ; Xiaochu Qi [États-Unis]Choices in Representation and Reduction Strategies for Lambda Terms in Intensional Contexts
006544 (2005) Silvio Ranise [France] ; Christophe Ringeissen [France] ; Calogero ZarbaCombining Data Structures with Nonstably Infinite Theories using Many-Sorted Logic
006645 (2004-06) Yannick Chevalier [France] ; Laurent Vigneron [France]Rule-based Programs describing Internet Security Protocols
006667 (2004-03-27) Luigi Liquori [France] ; Benjamin Wack [France]The Polymorphic Rewriting Calculus: Type checking vs. Type inference
006735 (2004) Logics for Resources, Processes and Programs
006784 (2004) Yannick Chevalier ; Laurent VigneronRule-based Programs describing Internet Security Protocols
006945 (2004) Siva Anantharaman ; Paliath Narendran ; Michael RusinowitchUnification Modulo ACUI Plus Distributivity Axioms
006E32 (2004) Calogero G. Zarba [France]C-tableaux
006E68 (2004) Benjamin Wack [France]The Simply-typed Pure Pattern Type System Ensures Strong Normalization
006E81 (2004) Claude Kirchner [France]Strategic Rewriting
007124 (2004) Calogero G. Zarba [France] ; Domenico Cantone ; Jacob T. SchwartzA Decision Procedure for a Fragment of Set Theory Involving Monotone, Additive, and Multiplicative Functions
007291 (2003-01-15) Gilles Barthe [France] ; Horatiu Cirstea [France] ; Claude Kirchner [France] ; Luigi Liquori [France]Pure Patterns Type Systems
007382 (2003) Germain FaureCalcul de réécriture explicite
007420 (2003) Gilles Barthe ; Horatiu Cirstea ; Claude Kirchner ; Luigi LiquoriPure Patterns Type Systems
007472 (2003) Gilles Dowek ; Thérèse Hardin ; Claude KirchnerTheorem Proving Modulo
007473 (2003) Horatiu Cirstea ; Claude Kirchner ; Luigi Liquori ; Benjamin WackRewrite Strategies in the Rewriting Calculus
007487 (2003) Leo Bachmair ; Ashish Tiwari ; Laurent VigneronAbstract Congruence Closure
007522 (2003) Cesare Tinelli ; Christophe RingeissenUnions of Non-Disjoint Theories and Combinations of Satisfiability Procedures
007775 (2003) Philippe De Groote ; Sylvain Pogodallam-Linear Context-Free Rewriting Systems as Abstract Categorial Grammars
007981 (2003) Gilles Dowek [France] ; Thérèse Hardin [France] ; Claude Kirchner [France]Theorem Proving Modulo
007B03 (2003) Leo Bachmair [États-Unis] ; Ashish Tiwari ; Laurent Vigneron [France]Abstract Congruence Closure
007D38 (2003) Gilles Dowek [France] ; Thérèse Hardin [France] ; Claude Kirchner [France]Theorem Proving Modulo Revised Version
008164 (2002) Eric DeplagneSystème de preuve modulo récurrence
008259 (2002) Mark G. J. Van Den Brand ; P. Klint ; J. J. VinjuTerm Rewriting with Type-safe Traversal Functions
008450 (2002) Peter Borovansky ; Claude Kirchner ; Hélène Kirchner ; Pierre-Etienne MoreauELAN from a rewriting logic point of view
008478 (2002) Luc Habert ; Jean-Marc Notin ; Didier GalmicheLINK : a Proof Environment based on Proof nets
008537 (2002) Clara BertolissiTraduction des Combinatory Reduction Systems en Rho-Calcul
008549 (2002) Hubert Dubois ; Hélène KirchnerAn algebraic semantics for objects in a rule-based language
008624 (2002) Germain Faure ; Claude KirchnerExceptions in the rewriting calculus
008858 (2002) Freek WiedijkA New Implementation of Automath
008914 (2002) Peter Borovansky [Slovaquie] ; Claude Kirchner [France] ; Hélène Kirchner [France] ; Pierre-Etienne Moreau [France]ELAN from a rewriting logic point of view
008B77 (2002) David Déharbe ; Silvio Ranise [France]BDD-Driven First-Order Satisfiability Procedures (Extended Version)
Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022