Nissim Francez

ORCID

Publication Activity (10 Years)

Years Active: 1973-2023
Publications (10 Years): 24

Top Venues

Publications

Nissim Francez
A Dialectic Contra-Classical Logic. Logica Universalis 17 (2) (2023)
Nissim Francez
A generalization of falsity in finitely-many valued logics. CoRR (2022)
Nissim Francez
A Generalization of Falsity in Finitely-many Valued Logics. Fundam. Informaticae 186 (1-4) (2022)
Nissim Francez
On the Role of Aristotle's Connexive Axioms in Non-connexive Logics. FLAP 8 (3) (2021)
Michael Kaminski, Nissim Francez
Calculi for Many-Valued Logics. Logica Universalis 15 (2) (2021)
Nissim Francez
Bilateralism based on Corrective Denial. FLAP 8 (2) (2021)
Nissim Francez
Connexive Restricted Quantification. Notre Dame J. Formal Log. 61 (3) (2020)
Michael Kaminski, Nissim Francez
De Morgan Interpretation of the Lambek-Grishin Calculus. Rev. Symb. Log. 13 (4) (2020)
Nissim Francez
Bilateralism, Trilateralism, Multilateralism and Poly-Sequents. J. Philos. Log. 48 (2) (2019)
Nissim Francez, Michael Kaminski
On Poly-logistic Natural-deduction for Finitely-valued Propositional Logics. FLAP 6 (2) (2019)
Nissim Francez
On Beall's New Interpretation of $$WK_{3}$$ W K 3. J. Log. Lang. Inf. 28 (1) (2019)
Nissim Francez, Michael Kaminski
Structural Rules for Multi-valued Logics. Logica Universalis 13 (1) (2019)
Nissim Francez
Bilaterilism does Provide a Proof Theoretic Treatment of Classical Logic (for non-technical reasons). FLAP 5 (8) (2018)
Nissim Francez
Diversification of Object-Languages for Propositional Logics. J. Log. Lang. Inf. 27 (3) (2018)
Nissim Francez
A Proof-Theoretic Semantics for Transitive Verbs with an Implicit Object. MOL (2017)
Nissim Francez, Bartosz Wieckowski
A Proof Theory for First-order Logic with Definiteness. FLAP 4 (2) (2017)
Nissim Francez, Michael Kaminski
A Proof-Theoretic Semantics for Exclusion. Logica Universalis 11 (4) (2017)
Nissim Francez
A Proof-Theoretic Semantics for Adjectival Modification. J. Log. Lang. Inf. 26 (1) (2017)
Nissim Francez
On harmony and permuting conversions. J. Appl. Log. 21 (2017)
Michael Kaminski, Nissim Francez
The Lambek Calculus Extended with Intuitionistic Propositional Logic. Stud Logica 104 (5) (2016)
Nissim Francez
Proof-Theoretic Semantics for Intensional Transitive Verbs. J. Semant. 33 (4) (2016)
Nissim Francez
Relevant harmony. J. Log. Comput. 26 (1) (2016)
Nissim Francez
Natural Deduction for Two Connexive Logics. FLAP 3 (3) (2016)
Nissim Francez
Views of proof-theoretic semantics: reified proof-theoretic meanings. J. Log. Comput. 26 (2) (2016)
Nissim Francez, Gilad Ben-Avi
Proof-Theoretic Reconstruction of Generalized Quantifiers. J. Semant. 32 (3) (2015)
Nissim Francez
On a Distinction of Two Facets of Meaning and its Role in Proof-theoretic Semantics. Logica Universalis 9 (1) (2015)
Nissim Francez
A proof-theoretic universal property of determiners. J. Appl. Log. 13 (4) (2015)
Nissim Francez
On the Notion of Canonical Derivations from Open Assumptions and its Role in Proof-Theoretic Semantics. Rev. Symb. Log. 8 (2) (2015)
Nissim Francez
The Granularity of Meaning in Proof-Theoretic Semantics. LACL (2014)
Nissim Francez
Bilateral Relevant Logic. Rev. Symb. Log. 7 (2) (2014)
Nissim Francez
A proof-theoretic semantics for contextual domain restriction. J. Lang. Model. 2 (2) (2014)
Nissim Francez
Harmony in Multiple-Conclusion Natural-Deduction. Logica Universalis 8 (2) (2014)
Nissim Francez
Bilateralism in Proof-Theoretic Semantics. J. Philos. Log. 43 (2-3) (2014)
Michael Kaminski, Nissim Francez
Relational Semantics of the Lambek Calculus Extended with Classical Propositional Logic. Stud Logica 102 (3) (2014)
Nissim Francez
A Logic Inspired by Natural Language: Quantifiers As Subnectors. J. Philos. Log. 43 (6) (2014)
Nissim Francez
When are different type-logical semantic definitions defining equivalent meanings? J. Comput. Syst. Sci. 78 (3) (2012)
Nissim Francez, Roy Dyckhoff
A Note on Harmony. J. Philos. Log. 41 (3) (2012)
Nissim Francez, Ian Pratt-Hartmann
Editors' Preface. Stud Logica 100 (4) (2012)
Nissim Francez, Gilad Ben-Avi
Proof-Theoretic Semantic Values for Logical operators. Rev. Symb. Log. 4 (3) (2011)
Daniel Genkin, Nissim Francez, Michael Kaminski
Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars. Essays in Memory of Amir Pnueli (2010)
Tamar Aizikowitz, Nissim Francez, Daniel Genkin, Michael Kaminski
Extending Free Pregroups with Lower Bounds. Stud Logica 95 (3) (2010)
Nissim Francez, Roy Dyckhoff, Gilad Ben-Avi
Proof-Theoretic Semantics for Subsentential Phrases. Stud Logica 94 (3) (2010)
Nissim Francez, Roy Dyckhoff
Proof-Theoretic Semantics for a Natural Language Fragment. MOL (2009)
Nissim Francez, Michael Kaminski
Commutation-augmented pregroup grammars and push-down automata with cancellation. Inf. Comput. 206 (9-10) (2008)
Sharon Shoham, Nissim Francez
Game Semantics for the Lambek-Calculus: Capturing Directionality and the Absence of Structural Rules. Stud Logica 90 (2) (2008)
Nissim Francez, Michael Kaminski
Commutation-Augmented Pregroup Grammars and Mildly Context-Sensitive Languages. Stud Logica 87 (2-3) (2007)
Nissim Francez, Michael Kaminski
Pushdown automata with cancellation and commutation-augmented pregroups grammars. LATA (2007)
Anna Zamansky, Nissim Francez, Yoad Winter
A 'Natural Logic' inference system using the Lambek calculus. J. Log. Lang. Inf. 15 (3) (2006)
Tatyana Veksler, Nissim Francez
A Lambek Automaton. Log. J. IGPL 14 (5) (2006)
Efrat Jaeger, Nissim Francez, Shuly Wintner
Unification Grammars and Off-Line Parsability. J. Log. Lang. Inf. 14 (2) (2005)
Nissim Francez
Lambek-Calculus with General Elimination Rules and Continuation Semantics. LACL (2005)
Yaroslav Fyodorov, Yoad Winter, Nissim Francez
Order-Based Inference in Natural Logic. Log. J. IGPL 11 (4) (2003)
Nissim Francez, Michael Kaminski
An algebraic characterization of deterministic regular languages over infinite alphabets. Theor. Comput. Sci. 306 (1-3) (2003)
Efrat Jaeger, Nissim Francez, Shuly Wintner
Guaranteeing Parsing Termination of Unification Grammars. COLING (2002)
Rani Nelken, Nissim Francez
Querying Temporal Databases Using Controlled Natural Language. COLING (2000)
Rani Nelken, Nissim Francez
The Algebraic Semantics of Interrogative NPs. Grammars 3 (2/3) (2000)
Shuly Wintner, Nissim Francez
Off-Line Parsability and the Well-Foundedness of Subsumption. J. Log. Lang. Inf. 8 (1) (1999)
Rachel Ben-Eliyahu-Zohary, Nissim Francez, Michael Kaminski
Similarity Preservation in Default Logic. Ann. Math. Artif. Intell. 25 (1-2) (1999)
Evgeniy Gabrilovich, Nissim Francez, Shuly Wintner
System Demonstration Natural Language Generation With Abstract Machine. INLG (1998)
Nissim Francez
Hypothetical Reasoning and Basic Non-constituent Coordination in Type-Logical Grammar. LACL (1998)
Frank S. de Boer, Nissim Francez, M. van Hulst, Frank A. Stomp
A proof theory of asynchronously communicating sequential processes. PROCOMET (1998)
Shmuel Sagiv, Nissim Francez, Michael Rodeh, Reinhard Wilhelm
A Logic-Based Approach to Program Flow Analysis. Acta Informatica 35 (6) (1998)
Nissim Francez
On Fibring Feature Logics with Concatenation Logics. LACL (1997)
Rani Nelken, Nissim Francez
Splitting the Reference Time: The Analogy between Nominal and Temporal Anaphora Revisited1. J. Semant. 14 (4) (1997)
Shuly Wintner, Evgeniy Gabrilovich, Nissim Francez
Amalia - A Unified Platform for Parsing and Generation CoRR (1997)
Shuly Wintner, Nissim Francez
Off-line Parsability and the Well-foundedness of Subsumption CoRR (1997)
Shuly Wintner, Nissim Francez
Parsing with Typed Feature Structures CoRR (1996)
Rani Nelken, Nissim Francez
Automatic Translation of Natural Language System Specifications. CAV (1996)
Shuly Wintner, Nissim Francez
Parsing with Typed Feature Structures CoRR (1996)
Shuly Wintner, Nissim Francez
Abstract Machine for Typed Feature Structures CoRR (1995)
Nissim Francez
Contrastive Logic. Log. J. IGPL 3 (5) (1995)
Rani Nelken, Nissim Francez
Splitting the Reference Time: Temporal Anaphora and Quantification in DRT. EACL (1995)
Rani Nelken, Nissim Francez
Splitting the Reference Time: Temporal Anaphora and Quantification in DRT CoRR (1995)
Shuly Wintner, Nissim Francez
Parsing with Typed Feature Structures. IWPT (1995)
Shuly Wintner, Nissim Francez
Abstract Machine for Typed Feature Structures. CoRR (1994)
Michael Kaminski, Nissim Francez
Finite-Memory Automata. Theor. Comput. Sci. 134 (2) (1994)
Yael Shemesh, Nissim Francez
Finite-State Unification Automata and Relational Languages Inf. Comput. 114 (2) (1994)
Sara Porat, Nissim Francez
Fairness in term rewriting systems. Methods Log. Comput. Sci. 1 (2) (1994)
Limor Fix, Nissim Francez, Orna Grumberg
Program Composition via Unification. Theor. Comput. Sci. 131 (1) (1994)
Paul C. Attie, Nissim Francez, Orna Grumberg
Fairness and Hyperfairness in Multi-Party Interactions. Distributed Comput. 6 (4) (1993)
Nissim Francez, Ralph-Johan Back, Reino Kurki-Suonio
On Equivalence-Completions of Fairness Assumtions. Formal Aspects Comput. 4 (6) (1992)
Limor Fix, Nissim Francez, Orna Grumberg
Program Composition via Unification. ICALP (1992)
Jean-Michel Couvreur, Nissim Francez, Mohamed G. Gouda
Asynchronous Unison (Extended Abstract). ICDCS (1992)
Martín Abadi, Bowen Alpern, Krzysztof R. Apt, Nissim Francez, Shmuel Katz, Leslie Lamport, Fred B. Schneider
Preserving Liveness: Comments on "Safety and Liveness from a Methodological Point of View". Inf. Process. Lett. 40 (3) (1991)
Limor Fix, Nissim Francez, Orna Grumberg
Program Composition and Modular Verification. ICALP (1991)
Nissim Francez, Ira R. Forman
Synchrony Loosening Transformations for Interacting Processes. CONCUR (1991)
Nissim Francez, Ira R. Forman
Interacting processes: a language for coordinated distributed programming. Jerusalem Conference on Information Technology (1990)
Nissim Francez
Distributed Logic Programming. Dagstuhl Seminar on Parallelization in Inference Systems (1990)
Nissim Francez
Corrigenda: Cooperating Proofs for Distributed Programs with Multiparty Interactions. Inf. Process. Lett. 34 (1) (1990)
Shmuel Sagiv, Nissim Francez, Michael Rodeh, Reinhard Wilhelm
A Logic-Based Approach to Data Flow Analysis Problem. PLILP (1990)
Michael Kaminski, Nissim Francez
Finite-Memory Automata (Extended Abstract) FOCS (1990)
Limor Fix, Nissim Francez, Orna Grumberg
Sematics-Driven Decompositions for the Verification of Distributed Programs. Programming Concepts and Methods (1990)
Nissim Francez, Ira R. Forman
Conflict Propogation. ICCL (1990)
Amir Rahat, Nissim Francez, Oded Shmueli
On the Equivalence of Deferred Substitution and Immediate Substitution Semantics for Logic Programs. JELIA (1990)
Paul C. Attie, Nissim Francez, Orna Grumberg
Fairness and Hyperfairness in Multi-Party Interactions. POPL (1990)
Nissim Francez, Ira R. Forman
Superimposition for Interacting Processes. CONCUR (1990)
Nissim Francez
Corrigenda: Cooperating Proofs for Distributed Programs with Multiparty Interactions. Inf. Process. Lett. 35 (5) (1990)
Nissim Francez
Cooperating Proofs for Distributed Programs with Multiparty Interactions. Inf. Process. Lett. 32 (5) (1989)
Sara Porat, Nissim Francez
Fairness in Context-Free Grammars under Every Choice-strategy Inf. Comput. 80 (3) (1989)
Michael Evangelist, Nissim Francez, Shmuel Katz
Multiparty Interactions for Interprocess Communication and Synchronization. IEEE Trans. Software Eng. 15 (11) (1989)

Nissim Francez.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Nissim Francez