Nissim Francez

Logica Universalis, 2023

2022

A Generalization of Falsity in Finitely-many Valued Logics.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2022

2021

Calculi for Many-Valued Logics.

[BibT_eX]

[DOI]

Logica Universalis, 2021

On the Role of Aristotle's Connexive Axioms in Non-connexive Logics.

[BibT_eX]

[DOI]

FLAP, 2021

Bilateralism based on Corrective Denial.

[BibT_eX]

[DOI]

FLAP, 2021

2020

De Morgan Interpretation of the Lambek-Grishin Calculus.

[BibT_eX]

[DOI]

Rev. Symb. Log., 2020

Connexive Restricted Quantification.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 2020

2019

Structural Rules for Multi-valued Logics.

[BibT_eX]

[DOI]

Logica Universalis, 2019

Bilateralism, Trilateralism, Multilateralism and Poly-Sequents.

[BibT_eX]

[DOI]

J. Philos. Log., 2019

On Beall's New Interpretation of $$WK_{3}$$ W K 3.

[BibT_eX]

[DOI]

J. Log. Lang. Inf., 2019

On Poly-logistic Natural-deduction for Finitely-valued Propositional Logics.

[BibT_eX]

[DOI]

FLAP, 2019

2018

Diversification of Object-Languages for Propositional Logics.

[BibT_eX]

[DOI]

J. Log. Lang. Inf., 2018

Bilaterilism does Provide a Proof Theoretic Treatment of Classical Logic (for non-technical reasons).

[BibT_eX]

[DOI]

FLAP, 2018

2017

A Proof-Theoretic Semantics for Exclusion.

[BibT_eX]

[DOI]

Logica Universalis, 2017

A Proof-Theoretic Semantics for Adjectival Modification.

[BibT_eX]

[DOI]

J. Log. Lang. Inf., 2017

On harmony and permuting conversions.

[BibT_eX]

[DOI]

J. Appl. Log., 2017

A Proof Theory for First-order Logic with Definiteness.

[BibT_eX]

[DOI]

Bartosz Wieckowski

FLAP, 2017

A Proof-Theoretic Semantics for Transitive Verbs with an Implicit Object.

[BibT_eX]

[DOI]

Proceedings of the 15th Meeting on the Mathematics of Language, 2017

2016

The Lambek Calculus Extended with Intuitionistic Propositional Logic.

[BibT_eX]

[DOI]

Stud Logica, 2016

Views of proof-theoretic semantics: reified proof-theoretic meanings.

[BibT_eX]

[DOI]

J. Log. Comput., 2016

Relevant harmony.

[BibT_eX]

[DOI]

J. Log. Comput., 2016

Proof-Theoretic Semantics for Intensional Transitive Verbs.

[BibT_eX]

[DOI]

J. Semant., 2016

Natural Deduction for Two Connexive Logics.

[BibT_eX]

[DOI]

FLAP, 2016

2015

On the Notion of Canonical Derivations from Open Assumptions and its Role in Proof-Theoretic Semantics.

[BibT_eX]

[DOI]

Rev. Symb. Log., 2015

On a Distinction of Two Facets of Meaning and its Role in Proof-theoretic Semantics.

[BibT_eX]

[DOI]

Logica Universalis, 2015

Proof-Theoretic Reconstruction of Generalized Quantifiers.

[BibT_eX]

[DOI]

Gilad Ben-Avi

J. Semant., 2015

A proof-theoretic universal property of determiners.

[BibT_eX]

[DOI]

J. Appl. Log., 2015

2014

Relational Semantics of the Lambek Calculus Extended with Classical Propositional Logic.

[BibT_eX]

[DOI]

Stud Logica, 2014

Bilateral Relevant Logic.

[BibT_eX]

[DOI]

Rev. Symb. Log., 2014

Harmony in Multiple-Conclusion Natural-Deduction.

[BibT_eX]

[DOI]

Logica Universalis, 2014

A Logic Inspired by Natural Language: Quantifiers As Subnectors.

[BibT_eX]

[DOI]

J. Philos. Log., 2014

Bilateralism in Proof-Theoretic Semantics.

[BibT_eX]

[DOI]

J. Philos. Log., 2014

A proof-theoretic semantics for contextual domain restriction.

[BibT_eX]

[DOI]

J. Lang. Model., 2014

The Granularity of Meaning in Proof-Theoretic Semantics.

[BibT_eX]

[DOI]

Proceedings of the Logical Aspects of Computational Linguistics, 2014

2012

Editors' Preface.

[BibT_eX]

[DOI]

Ian Pratt-Hartmann

Stud Logica, 2012

A Note on Harmony.

[BibT_eX]

[DOI]

Roy Dyckhoff

J. Philos. Log., 2012

When are different type-logical semantic definitions defining equivalent meanings?

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2012

2011

Proof-Theoretic Semantic Values for Logical operators.

[BibT_eX]

[DOI]

Gilad Ben-Avi

Rev. Symb. Log., 2011

2010

Proof-Theoretic Semantics for Subsentential Phrases.

[BibT_eX]

[DOI]

Roy Dyckhoff

Gilad Ben-Avi

Stud Logica, 2010

Extending Free Pregroups with Lower Bounds.

[BibT_eX]

[DOI]

Stud Logica, 2010

Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars.

[BibT_eX]

[DOI]

Daniel Genkin

Proceedings of the Time for Verification, 2010

2009

Proof-Theoretic Semantics for a Natural Language Fragment.

[BibT_eX]

[DOI]

Roy Dyckhoff

Proceedings of the Mathematics of Language, 10th and 11th Biennial Conference, 2009

2008

Game Semantics for the Lambek-Calculus: Capturing Directionality and the Absence of Structural Rules.

[BibT_eX]

[DOI]

Sharon Shoham

Stud Logica, 2008

Commutation-augmented pregroup grammars and push-down automata with cancellation.

[BibT_eX]

[DOI]

Inf. Comput., 2008

2007

Commutation-Augmented Pregroup Grammars and Mildly Context-Sensitive Languages.

[BibT_eX]

[DOI]

Stud Logica, 2007

Pushdown automata with cancellation and commutation-augmented pregroups grammars.

[BibT_eX]

Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

2006

A 'Natural Logic' inference system using the Lambek calculus.

[BibT_eX]

[DOI]

Anna Zamansky

Yoad Winter

J. Log. Lang. Inf., 2006

A Lambek Automaton.

[BibT_eX]

[DOI]

Tatyana Veksler

Log. J. IGPL, 2006

2005

Unification Grammars and Off-Line Parsability.

[BibT_eX]

[DOI]

Efrat Jaeger

J. Log. Lang. Inf., 2005

Lambek-Calculus with General Elimination Rules and Continuation Semantics.

[BibT_eX]

[DOI]

Proceedings of the Logical Aspects of Computational Linguistics, 2005

2003

An algebraic characterization of deterministic regular languages over infinite alphabets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Order-Based Inference in Natural Logic.

[BibT_eX]

[DOI]

Yaroslav Fyodorov

Yoad Winter

Log. J. IGPL, 2003

2002

Guaranteeing Parsing Termination of Unification Grammars.

[BibT_eX]

[DOI]

Efrat Jaeger

Proceedings of the 19th International Conference on Computational Linguistics, 2002

2000

The Algebraic Semantics of Interrogative NPs.

[BibT_eX]

[DOI]

Grammars, 2000

Querying Temporal Databases Using Controlled Natural Language.

[BibT_eX]

[DOI]

Proceedings of the COLING 2000, 18th International Conference on Computational Linguistics, Proceedings of the Conference, 2 Volumes, July 31, 2000

1999

Off-Line Parsability and the Well-Foundedness of Subsumption.

[BibT_eX]

[DOI]

Rachel Ben-Eliyahu-Zohary

J. Log. Lang. Inf., 1999

Similarity Preservation in Default Logic.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 1999

1998

A Logic-Based Approach to Program Flow Analysis.

[BibT_eX]

[DOI]

Acta Informatica, 1998

A proof theory of asynchronously communicating sequential processes.

[BibT_eX]

Proceedings of the Programming Concepts and Methods, 1998

Hypothetical Reasoning and Basic Non-constituent Coordination in Type-Logical Grammar.

[BibT_eX]

[DOI]

Proceedings of the Logical Aspects of Computational Linguistics, 1998

System Demonstration Natural Language Generation With Abstract Machine.

[BibT_eX]

[DOI]

Evgeniy Gabrilovich

Proceedings of the Ninth International Workshop on Natural Language Generation, 1998

1997

Splitting the Reference Time: The Analogy between Nominal and Temporal Anaphora Revisited1.

[BibT_eX]

[DOI]

J. Semant., 1997

Amalia - A Unified Platform for Parsing and Generation

[BibT_eX]

[DOI]

Evgeniy Gabrilovich

CoRR, 1997

On Fibring Feature Logics with Concatenation Logics.

[BibT_eX]

[DOI]

Proceedings of the Logical Aspects of Computational Linguistics, 1997

1996

Automatic Translation of Natural Language System Specifications.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 8th International Conference, 1996

Interacting processes - a multiparty approach to coordinated distributed processing.

[BibT_eX]

Addison-Wesley, ISBN: 978-0-201-56528-7, 1996

1995

Contrastive Logic.

[BibT_eX]

[DOI]

Log. J. IGPL, 1995

Abstract Machine for Typed Feature Structures

[BibT_eX]

[DOI]

CoRR, 1995

Parsing with Typed Feature Structures.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Workshop on Parsing Technologies, 1995

Splitting the Reference Time: Temporal Anaphora and Quantification in DRT.

[BibT_eX]

[DOI]

Proceedings of the EACL 1995, 1995

1994

Finite-State Unification Automata and Relational Languages

[BibT_eX]

[DOI]

Yael Shemesh

Inf. Comput., November, 1994

Finite-Memory Automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

Program Composition via Unification.

[BibT_eX]

[DOI]

Limor Fix

Theor. Comput. Sci., 1994

Fairness in term rewriting systems.

[BibT_eX]

[DOI]

Methods Log. Comput. Sci., 1994

1993

Fairness and Hyperfairness in Multi-Party Interactions.

[BibT_eX]

[DOI]

Paul C. Attie

Distributed Comput., 1993

1992

On Equivalence-Completions of Fairness Assumtions.

[BibT_eX]

[DOI]

Ralph-Johan Back

Reino Kurki-Suonio

Formal Aspects Comput., 1992

Asynchronous Unison (Extended Abstract).

[BibT_eX]

[DOI]

Jean-Michel Couvreur

Mohamed G. Gouda

Proceedings of the 12th International Conference on Distributed Computing Systems, 1992

Program verification.

[BibT_eX]

International computer science series, Addison-Wesley, ISBN: 978-0-201-41608-4, 1992

1991

Preserving Liveness: Comments on "Safety and Liveness from a Methodological Point of View".

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

Program Composition and Modular Verification.

[BibT_eX]

[DOI]

Limor Fix

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

Synchrony Loosening Transformations for Interacting Processes.

[BibT_eX]

[DOI]

Proceedings of the CONCUR '91, 1991

1990

Corrigenda: Cooperating Proofs for Distributed Programs with Multiparty Interactions.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1990

A Logic-Based Approach to Data Flow Analysis Problem.

[BibT_eX]

[DOI]

Proceedings of the Programming Language Implementation and Logic Programming, 1990

On the Equivalence of Deferred Substitution and Immediate Substitution Semantics for Logic Programs.

[BibT_eX]

[DOI]

Amir Rahat

Oded Shmueli

Proceedings of the Logics in AI, European Workshop, 1990

Interacting processes: a language for coordinated distributed programming.

[BibT_eX]

[DOI]

Proceedings of the Next Decade in Information Technology: Proceedings of the 5th Jerusalem Conference on Information Technology 1990, 1990

Sematics-Driven Decompositions for the Verification of Distributed Programs.

[BibT_eX]

Limor Fix

Proceedings of the Programming concepts and methods: Proceedings of the IFIP Working Group 2.2, 1990

Conflict Propogation.

[BibT_eX]

[DOI]

Proceedings of the 1990 Internation Conference on Computer Languages, 1990

Finite-Memory Automata (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

Distributed Logic Programming.

[BibT_eX]

Proceedings of the Parallelization in Inference Systems, 1990

Superimposition for Interacting Processes.

[BibT_eX]

[DOI]

Proceedings of the CONCUR '90, 1990

1989

Fairness in Context-Free Grammars under Every Choice-strategy

[BibT_eX]

[DOI]

Inf. Comput., March, 1989

Multiparty Interactions for Interprocess Communication and Synchronization.

[BibT_eX]

[DOI]

Michael Evangelist

IEEE Trans. Software Eng., 1989

Cooperating Proofs for Distributed Programs with Multiparty Interactions.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1989

Resolving Circularity in Attribute Grammars with Applications to Data Flow Analysis.

[BibT_eX]

[DOI]

Proceedings of the Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, 1989

1988

Infinite Trees, Markings and Well-Foundedness

[BibT_eX]

[DOI]

Ran Rinat

Inf. Comput., November, 1988

Appraising Fairness in Languages for Distributed Programming.

[BibT_eX]

[DOI]

Krzysztof R. Apt

Distributed Comput., 1988

A Compositional Approach to Superimposition.

[BibT_eX]

[DOI]

Luc Bougé

Proceedings of the Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, 1988

1987

Fairness and the axioms of control predicates.

[BibT_eX]

[DOI]

Int. J. Parallel Program., 1987

1986

Script: A Communication Abstraction Mechanism and Its Verification.

[BibT_eX]

[DOI]

Brent Hailpern

Gadi Taubenfeld

Sci. Comput. Program., 1986

A Complete Rule for Equifair Termination.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1986

A New Approach to Detection of Locally Indicative Stability.

[BibT_eX]

[DOI]

Nir Shavit

Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

Full-Commutation and Fair-Termination in Equational (and Combined) Term-Rewriting Systems.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 27, 1986

Fairness.

[BibT_eX]

[DOI]

Texts and Monographs in Computer Science, Springer, ISBN: 978-1-4612-4886-6, 1986

1985

Symmetric Intertask Communication.

[BibT_eX]

[DOI]

Shaula Yemini

ACM Trans. Program. Lang. Syst., 1985

An environment for logic programming.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGPLAN 85 Symposium on Language Issues in Programming Environments, 1985

Script: A Communication Abstraction Mechanism.

[BibT_eX]

[DOI]

Brent Hailpern

ACM SIGOPS Oper. Syst. Rev., 1985

A Proof Rule for Fair Termination of Guarded Commands

[BibT_eX]

[DOI]

Inf. Control., 1985

Fairness in Context-Free Grammars under Canonical Derivations.

[BibT_eX]

[DOI]

Proceedings of the STACS 85, 1985

Proving Termination of Prolog Programs.

[BibT_eX]

[DOI]

Proceedings of the Logics of Programs, 1985

1984

Modeling the Distributed Termination Convention of CSP.

[BibT_eX]

[DOI]

Krzysztof R. Apt

ACM Trans. Program. Lang. Syst., 1984

A Linear-History Semantics for Languages for Distributed Programming.

[BibT_eX]

[DOI]

Daniel Lehmann

Theor. Comput. Sci., 1984

A Weakest Precondition Semantics for Communicating Processes.

[BibT_eX]

[DOI]

Tzilla Elrad

Theor. Comput. Sci., 1984

Can Message Buffers Be Axiomatized in Linear Temporal Logic?

[BibT_eX]

[DOI]

Inf. Control., 1984

Generalized Fair Termination.

[BibT_eX]

[DOI]

Dexter Kozen

Proceedings of the Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, 1984

Fail Termination of Communicating Processe.

[BibT_eX]

[DOI]

Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, 1984

Proof Rules for Communication Abstractions (Abstract).

[BibT_eX]

[DOI]

Gadi Taubenfeld

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1984

1983

Extended Naming Conventions for Communicating Processes.

[BibT_eX]

[DOI]

Sci. Comput. Program., 1983

Product Properties and Their Direct Verification.

[BibT_eX]

[DOI]

Acta Informatica, 1983

A methodology for verifying request processing protocols.

[BibT_eX]

[DOI]

Proceedings of the symposium on Communications Architectures & Protocols, 1983

Distributed k-Selection: From a Sequential to a Distributed Algorithm.

[BibT_eX]

[DOI]

Liuba Shrira

Michael Rodeh

Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, 1983

A Compete Proof Rule for Strong Equifair Termination.

[BibT_eX]

[DOI]

Proceedings of the Logics of Programs, 1983

1982

Achieving Distributed Termination without Freezing.

[BibT_eX]

[DOI]

Michael Rodeh

IEEE Trans. Software Eng., 1982

Decomposition of Distributed Programs into Communication-Closed Layers.

[BibT_eX]

[DOI]

Tzilla Elrad

Sci. Comput. Program., 1982

Fair Deriviations in Context-Free Grammars

[BibT_eX]

[DOI]

Inf. Control., 1982

Can Message Buffers be Characterized in Linear Temporal Logic?

[BibT_eX]

[DOI]

Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1982

1981

An Experimental Implementation of CSP.

[BibT_eX]

Liuba Shrira

Proceedings of the 2nd International Conference on Distributed Computing Systems, 1981

1980

Distributed Termination.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 1980

A Proof System for Communicating Sequential Processes.

[BibT_eX]

[DOI]

Krzysztof R. Apt

Willem P. de Roever

ACM Trans. Program. Lang. Syst., 1980

A Distributed Abstract Data Type Implemented by a Probabilistic Communication Scheme

[BibT_eX]

[DOI]

Michael Rodeh

Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

A Linear History Semantics for Distributed Languages (Extended Abstract)

[BibT_eX]

[DOI]

Daniel Lehmann

Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979

Semantics of Nondeterminism, Concurrency, and Communication.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1979

On Achieving Distributed Termination.

[BibT_eX]

[DOI]

Proceedings of the Semantics of Concurrent Computation, 1979

1978

An Application of a Method for Analysis of Cyclic Programs.

[BibT_eX]

[DOI]

IEEE Trans. Software Eng., 1978

A Proof Method for Cyclic Programs.

[BibT_eX]

[DOI]

Acta Informatica, 1978

Semantics of Nondeterminism, Concurrency and Communication (Extended Abstract).

[BibT_eX]

[DOI]

C. A. R. Hoare

Willem P. de Roever

Proceedings of the Mathematical Foundations of Computer Science 1978, 1978

1977

A Case for a Forward Predicate Transformer.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1977

Another Advantage of Keyword Notation for Parameter Communication with Subprograms.

[BibT_eX]

Commun. ACM, 1977

Backtracking in Recursive Computations.

[BibT_eX]

[DOI]

Boris Klebansky

Acta Informatica, 1977

1973

On the Non-Compactness of the Class of Program Schemas.

[BibT_eX]

[DOI]