UNIF - researchr conference series publications

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 84 from 84

2020

An Investigation into General Nominal Equational Problems (Work in progress)Mauricio Ayala-Rincón, Maribel Fernández, Daniele Nantes Sobrinho, Deivid Vale. UNIF 2020: [doi]

About the unification type of K+☐☐⊥Philippe Balbiani, Çigdem Gencer, Maryam Rostamigiv, Tinko Tinchev. UNIF 2020: [doi]

A, C, and AC Nominal Anti-UnificationAlexander Baumgartner, Daniele Nantes Sobrinho. UNIF 2020: [doi]

On the Unification of Term SchemataDavid M. Cerna, Alexander Leitsch, Anela Lolic. UNIF 2020: [doi]

Rewriting in Protocol VerificationStéphanie Delaune. UNIF 2020: [doi]

Terminating Non-Disjoint Combined Unification (Extended Abstract)Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen. UNIF 2020: [doi]

Unification of DragsJean-Pierre Jouannaud, Fernando Orejas. UNIF 2020: [doi]

Proximity-Based Unification with Arity MismatchTemur Kutsia, Cleo Pau. UNIF 2020: [doi]

Proceedings of the 34th International Workshop on Unification, UNIF 2020, Linz, Austria, June 29, 2020Temur Kutsia, Andrew M. Marshall, editors, 2020. [doi]

Algorithmic Problems in Synthesized Cryptosystems (Extended Abstract)Andrew M. Marshall, Catherine Meadows 0001, Paliath Narendran, Veena Ravishankar, Brandon Rozek. UNIF 2020: [doi]

An Improved Algorithm for Testing Whether a Special String Rewriting System is ConfluentPaliath Narendran, Saumya Arora, Yu Zhang. UNIF 2020: [doi]

Some Results on Prefix GrammarsPaliath Narendran, Ashley Suchy, Yu Zhang. UNIF 2020: [doi]

Unification on the RunThomas Prokosch, François Bry. UNIF 2020: [doi]

Nominal Algorithms: Applications and ExtensionsManfred Schmidt-Schauß. UNIF 2020: [doi]

2016

The Unification Type of ACUI w.r.t. the Unrestricted Instantiation Preorder is not FinitaryFranz Baader, Pierre Ludmann. UNIF 2016: 31-36 [doi]

Approximately Solving Set EquationsFranz Baader, Pavlos Marantidis, Alexander Okhotin. UNIF 2016: 37-43 [doi]

Solving equations in pure double Boolean algebrasPhilippe Balbiani. UNIF 2016: 13-16 [doi]

Overlap and Independence in Multiset Comprehension PatternsIliano Cervesato, Edmund S. L. Lam. UNIF 2016: 51-56 [doi]

Unification in predicate logicWojciech Dzik, Piotr Wojtylak. UNIF 2016: 9-12 [doi]

Proceedings of the 30th International Workshop on Unification, UNIF 2016, Porto, Portugal, June 26, 2016Silvio Ghilardi, Manfred Schmidt-Schauß, editors, 2016. [doi]

Notes on Lynch-Morawska SystemsDaniel S. Hono II, Namrata Galatage, Kimberly A. Gero, Paliath Narendran, Ananya Subburathinam. UNIF 2016: 25-30 [doi]

Lynch-Morawska Systems on StringsDaniel S. Hono II, Paliath Narendran, Rafael Veras. UNIF 2016: 19-24 [doi]

Let's Unify With Scala Pattern Matching!Edmund Soon Lee Lam, Iliano Cervesato. UNIF 2016: 43-48 [doi]

Type unification for structural types in Java (Extended Abstract)Martin Plümicke. UNIF 2016: 49 [doi]

Automated Symbolic Proofs of Security ProtocolsRalf Sasse. UNIF 2016: 6-8 [doi]

Universal freeness and admissibilityMichal Stronko. UNIF 2016: 57-61 [doi]

2014

Extensible Symbolic System AnalysisJosé Meseguer 0001. UNIF 2014: 1-4 [doi]

Matching with respect to general concept inclusions in the Description Logic ELFranz Baader, Barbara Morawska 0001. UNIF 2014: 22-25 [doi]

Unification in the normal modal logic Alt1Philippe Balbiani, Tinko Tinchev. UNIF 2014: 26-32 [doi]

Nominal Anti-UnificationAlexander Baumgartner, Temur Kutsia, Jordi Levy, Mateu Villaret. UNIF 2014: 62-68 [doi]

Constraint Manipulation in SGGSMaria Paola Bonacina, David A. Plaisted. UNIF 2014: 47-54 [doi]

From Admissibility to a New Hierarchy of Unification TypesLeonardo Manuel Cabrer, George Metcalfe. UNIF 2014: 41-46 [doi]

Hierarchical Combination of Matching Algorithms (Extended Abstract)Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen. UNIF 2014: 36-40 [doi]

On Asymmetric Unification and the Combination Problem in Disjoint Theories (Extended Abstract)Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Catherine Meadows 0001, Paliath Narendran, Christophe Ringeissen. UNIF 2014: 33-35 [doi]

Unification Modulo Common List FunctionsPeter Hibbs, Paliath Narendran, Shweta Mehto. UNIF 2014: 15-21 [doi]

Proceedings of the 28th International Workshop on Unification, UNIF 2014, Vienna, Austria, July 13, 2014Temur Kutsia, Christophe Ringeissen, editors, 2014. [doi]

On the Limits of Second-Order UnificationJordi Levy. UNIF 2014: 5-14 [doi]

Two-sided unification is NP-completeTatyana A. Novikova, Vladimir A. Zakharov. UNIF 2014: 55-61 [doi]

A Categorical Perspective on Pattern Unification (Extended Abstract)Andrea Vezzosi, Andreas Abel 0001. UNIF 2014: 69-73 [doi]

Towards a better-behaved unification algorithm for CoqBeta Ziliani, Matthieu Sozeau. UNIF 2014: 74-87 [doi]

2011

Proceedings of the 25th International Workshop on Unification, UNIF 2011, Wroclaw, Poland, July 31, 2011Franz Baader, Barbara Morawska 0001, Jan Otop, editors, 2011. [doi]

Computing Local Unifiers in the Description Logic EL without the Top ConceptFranz Baader, Nguyen Thanh Binh 0003, Stefan Borgwardt, Barbara Morawska 0001. UNIF 2011: 2-8 [doi]

Computing finite variants for subterm convergent rewrite systemsStefan Ciobaca. UNIF 2011: 28-34 [doi]

Projective Unifiers in Modal LogicsWojciech Dzik, Piotr Wojtylak. UNIF 2011: 21-27 [doi]

Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol AnalysisSerdar Erbatur, Santiago Escobar 0001, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, Catherine Meadows 0001, José Meseguer 0001, Paliath Narendran, Ralf Sasse. UNIF 2011: 59-64 [doi]

αν calculusBen Kavanagh, James Cheney. UNIF 2011: 42-51 [doi]

Invited talk: Unification in Cryptographic Protocol AnalysisChristopher Lynch. UNIF 2011: 1 [doi]

Unification of anti-termsJan Otop. UNIF 2011: 9-14 [doi]

A Unification Algorithm to Compute Overlaps in a Call-by-Need Lambda-Calculus with Variable-Binding ChainsConrad Rau, Manfred Schmidt-Schauß. UNIF 2011: 35-41 [doi]

Joint Constraint Abduction ProblemsLukasz Stafiniak. UNIF 2011: 15-20 [doi]

Does Unification Help in Normalization?Rakesh M. Verma, Wei Guo. UNIF 2011: 52-58 [doi]

2010

UNIF, Proceedings2010.

2008

Equational Unification by Variant Narrowing (Extended Abstract)Santiago Escobar 0001, José Meseguer 0001, Ralf Sasse. UNIF 2008: 35-39 [doi]

Unification modulo Homomorphic Encryption is DecidableSiva Anantharaman, Hai Lin 0005, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch. UNIF 2008: 1-15 [doi]

First-order unification using variable-free relational algebraEmilio Jesús Gallego Arias, James Lipton, Julio Mariño, Pablo Nogueira. UNIF 2008: 40-54 [doi]

Matching linear and non-linear trace patterns with regular policiesFranz Baader, Andreas Bauer 0002, Alwen Tiu. UNIF 2008: 16-24 [doi]

Unification in the Description Logic EL is of Type ZeroFranz Baader, Barbara Morawska 0001. UNIF 2008: 25-34 [doi]

Proceedings of the 22nd International Workshop on Unification, UNIF 2008, Castle of Hagenberg, Austria, July 18, 2008Mircea Marin, editor, 2008. [doi]

Matching with Membership Constraints for Hedge and Context VariablesMircea Marin, Temur Kutsia. UNIF 2008: 55-68 [doi]

A tractable logic of typesAllan Ramsay. UNIF 2008: 69-81 [doi]

String Unification is Essentially InfinitaryJörg H. Siekmann, Michael Hoche, Peter Szabó. UNIF 2008: 82-102 [doi]

1995

Complete Solving of Linear Diophantine Equations and Inequations without Adding Slack VariablesFarid Ajili, Evelyne Contejean. UNIF 1995: 1

On decision problems for second order unificationGilles Amiot. UNIF 1995: 2

Constraint-Based Protocols for Distributed Problem Solving (Ext. Abstract)Francesca Arcelli, Uwe M. Borghoff, Ferrante Formato, Remo Pareschi. UNIF 1995: 3-5

On the Combination of Symbolic Constraints, Solution Domains, and Constraint SolversFranz Baader, Klaus U. Schulz. UNIF 1995: 6-8

Representing Unification in a Logical FrameworkJason Brown, Lincoln A. Wallen. UNIF 1995: 10-12

Linear diophantine equations, Presburger arithmetic and finite automataHubert Comon. UNIF 1995: 13

Efficient Second-Order AC-Matching AlgorithmRégis Curien, Zhenyu Qian. UNIF 1995: 14-16

From Elliott-Mac Mahon to an algorithm for general linear constraints on naturalsEric Domenjoud. UNIF 1995: 17

Objects communication by extending the unificationFrancisco J. Durán, Ernesto Pimentel 0001. UNIF 1995: 18-21

Redundancy and SaturationHarald Ganzinger. UNIF 1995: 27

Redundancy and SaturationClaus Hintermeier. UNIF 1995: 28

EXTRA: A Tool for Data Expression Transformation in an FDT EnvironmentManuel J. Fernández Iglesias, Martín Llamas, Juan Quemada. UNIF 1995: 22-26

A Rule-Constructive Geometric Constraint SolverR. Juan-Arinyo, Toni Soto. UNIF 1995: 29-32

A Decidable Second-Order Unification ProblemJordi Levy. UNIF 1995: 33

An Attempt of Integration of LSE Narrowing and Directed NarrowingSébastien Limet, Pierre Réty. UNIF 1995: 34-37

Undecidability of second-order complement problemsDenis Lugiez. UNIF 1995: 38

Oriented Equational Logic Programming is CompleteChristopher Lynch. UNIF 1995: 39-42

Lazy Narrowing: Strong Completeness and Eager Variable EliminationAart Middeldorp, Satoshi Okui, Tetsuo Ida. UNIF 1995: 43-46

9th International Workshop on Unification, UNIF 1995, Sitges, Spain, April 2-3, 1995Robert Nieuwenhuis, Albert Rubio, editors, 1995.

Precedence Constraints in TempoRafael Ramírez-Meléndez. UNIF 1995: 47-51

An Algorithm for Distributive UnificationManfred Schmidt-Schauß. UNIF 1995: 52

Feature Trees over Arbitrary StructuresRalf Treinen. UNIF 1995: 53-57

Normalization Properties of Typeable Term Rewriting Systems (Abstract)Steffen van Bakel, Maribel Fernández. UNIF 1995: 9

Sign in or sign up to see more results.

runs on WebDSL