default search action
Nissim Francez
Person information
- affiliation: Technion - Israel Institute of Technology, Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
- [j90]Nissim Francez:
A Dialectic Contra-Classical Logic. Logica Universalis 17(2): 221-229 (2023) - 2022
- [j89]Nissim Francez:
A Generalization of Falsity in Finitely-many Valued Logics. Fundam. Informaticae 186(1-4): 121-132 (2022) - [i8]Nissim Francez:
A generalization of falsity in finitely-many valued logics. CoRR abs/2203.16890 (2022) - 2021
- [j88]Nissim Francez:
Bilateralism based on Corrective Denial. FLAP 8(2): 497-510 (2021) - [j87]Nissim Francez:
On the Role of Aristotle's Connexive Axioms in Non-connexive Logics. FLAP 8(3): 659-670 (2021) - [j86]Michael Kaminski, Nissim Francez:
Calculi for Many-Valued Logics. Logica Universalis 15(2): 193-226 (2021) - 2020
- [j85]Nissim Francez:
Connexive Restricted Quantification. Notre Dame J. Formal Log. 61(3): 383-402 (2020) - [j84]Michael Kaminski, Nissim Francez:
De Morgan Interpretation of the Lambek-Grishin Calculus. Rev. Symb. Log. 13(4): 845-856 (2020)
2010 – 2019
- 2019
- [j83]Nissim Francez, Michael Kaminski:
On Poly-logistic Natural-deduction for Finitely-valued Propositional Logics. FLAP 6(2): 255-290 (2019) - [j82]Nissim Francez:
On Beall's New Interpretation of $$WK_{3}$$ W K 3. J. Log. Lang. Inf. 28(1): 1-7 (2019) - [j81]Nissim Francez:
Bilateralism, Trilateralism, Multilateralism and Poly-Sequents. J. Philos. Log. 48(2): 245-262 (2019) - [j80]Nissim Francez, Michael Kaminski:
Structural Rules for Multi-valued Logics. Logica Universalis 13(1): 65-75 (2019) - 2018
- [j79]Nissim Francez:
Bilaterilism does Provide a Proof Theoretic Treatment of Classical Logic (for non-technical reasons). FLAP 5(8): 1653-1662 (2018) - [j78]Nissim Francez:
Diversification of Object-Languages for Propositional Logics. J. Log. Lang. Inf. 27(3): 193-203 (2018) - 2017
- [j77]Nissim Francez, Bartosz Wieckowski:
A Proof Theory for First-order Logic with Definiteness. FLAP 4(2) (2017) - [j76]Nissim Francez:
On harmony and permuting conversions. J. Appl. Log. 21: 14-23 (2017) - [j75]Nissim Francez:
A Proof-Theoretic Semantics for Adjectival Modification. J. Log. Lang. Inf. 26(1): 21-43 (2017) - [j74]Nissim Francez, Michael Kaminski:
A Proof-Theoretic Semantics for Exclusion. Logica Universalis 11(4): 489-505 (2017) - [c53]Nissim Francez:
A Proof-Theoretic Semantics for Transitive Verbs with an Implicit Object. MOL 2017: 59-67 - 2016
- [j73]Nissim Francez:
Natural Deduction for Two Connexive Logics. FLAP 3(3): 479-504 (2016) - [j72]Nissim Francez:
Proof-Theoretic Semantics for Intensional Transitive Verbs. J. Semant. 33(4): 803-826 (2016) - [j71]Nissim Francez:
Relevant harmony. J. Log. Comput. 26(1): 235-245 (2016) - [j70]Nissim Francez:
Views of proof-theoretic semantics: reified proof-theoretic meanings. J. Log. Comput. 26(2): 479-494 (2016) - [j69]Michael Kaminski, Nissim Francez:
The Lambek Calculus Extended with Intuitionistic Propositional Logic. Stud Logica 104(5): 1051-1082 (2016) - 2015
- [j68]Nissim Francez:
A proof-theoretic universal property of determiners. J. Appl. Log. 13(4): 799-808 (2015) - [j67]Nissim Francez, Gilad Ben-Avi:
Proof-Theoretic Reconstruction of Generalized Quantifiers. J. Semant. 32(3): 313-371 (2015) - [j66]Nissim Francez:
On a Distinction of Two Facets of Meaning and its Role in Proof-theoretic Semantics. Logica Universalis 9(1): 121-127 (2015) - [j65]Nissim Francez:
On the Notion of Canonical Derivations from Open Assumptions and its Role in Proof-Theoretic Semantics. Rev. Symb. Log. 8(2): 296-305 (2015) - 2014
- [j64]Nissim Francez:
A proof-theoretic semantics for contextual domain restriction. J. Lang. Model. 2(2): 249-283 (2014) - [j63]Nissim Francez:
Bilateralism in Proof-Theoretic Semantics. J. Philos. Log. 43(2-3): 239-259 (2014) - [j62]Nissim Francez:
A Logic Inspired by Natural Language: Quantifiers As Subnectors. J. Philos. Log. 43(6): 1153-1172 (2014) - [j61]Nissim Francez:
Harmony in Multiple-Conclusion Natural-Deduction. Logica Universalis 8(2): 215-259 (2014) - [j60]Nissim Francez:
Bilateral Relevant Logic. Rev. Symb. Log. 7(2): 250-272 (2014) - [j59]Michael Kaminski, Nissim Francez:
Relational Semantics of the Lambek Calculus Extended with Classical Propositional Logic. Stud Logica 102(3): 479-497 (2014) - [c52]Nissim Francez:
The Granularity of Meaning in Proof-Theoretic Semantics. LACL 2014: 96-106 - 2012
- [j58]Nissim Francez:
When are different type-logical semantic definitions defining equivalent meanings? J. Comput. Syst. Sci. 78(3): 960-969 (2012) - [j57]Nissim Francez, Roy Dyckhoff:
A Note on Harmony. J. Philos. Log. 41(3): 613-628 (2012) - [j56]Nissim Francez, Ian Pratt-Hartmann:
Editors' Preface. Stud Logica 100(4): 663-665 (2012) - 2011
- [j55]Nissim Francez, Gilad Ben-Avi:
Proof-Theoretic Semantic Values for Logical operators. Rev. Symb. Log. 4(3): 466-478 (2011) - 2010
- [j54]Nissim Francez, Roy Dyckhoff, Gilad Ben-Avi:
Proof-Theoretic Semantics for Subsentential Phrases. Stud Logica 94(3): 381-401 (2010) - [j53]Tamar Aizikowitz, Nissim Francez, Daniel Genkin, Michael Kaminski:
Extending Free Pregroups with Lower Bounds. Stud Logica 95(3): 417-441 (2010) - [c51]Daniel Genkin, Nissim Francez, Michael Kaminski:
Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars. Essays in Memory of Amir Pnueli 2010: 144-166
2000 – 2009
- 2009
- [c50]Nissim Francez, Roy Dyckhoff:
Proof-Theoretic Semantics for a Natural Language Fragment. MOL 2009: 56-71 - 2008
- [j52]Nissim Francez, Michael Kaminski:
Commutation-augmented pregroup grammars and push-down automata with cancellation. Inf. Comput. 206(9-10): 1018-1032 (2008) - [j51]Sharon Shoham, Nissim Francez:
Game Semantics for the Lambek-Calculus: Capturing Directionality and the Absence of Structural Rules. Stud Logica 90(2): 161-188 (2008) - 2007
- [j50]Nissim Francez, Michael Kaminski:
Commutation-Augmented Pregroup Grammars and Mildly Context-Sensitive Languages. Stud Logica 87(2-3): 295-321 (2007) - [c49]Nissim Francez, Michael Kaminski:
Pushdown automata with cancellation and commutation-augmented pregroups grammars. LATA 2007: 7-26 - 2006
- [j49]Tatyana Veksler, Nissim Francez:
A Lambek Automaton. Log. J. IGPL 14(5): 659-708 (2006) - [j48]Anna Zamansky, Nissim Francez, Yoad Winter:
A 'Natural Logic' inference system using the Lambek calculus. J. Log. Lang. Inf. 15(3): 273-295 (2006) - 2005
- [j47]Efrat Jaeger, Nissim Francez, Shuly Wintner:
Unification Grammars and Off-Line Parsability. J. Log. Lang. Inf. 14(2): 199-234 (2005) - [c48]Nissim Francez:
Lambek-Calculus with General Elimination Rules and Continuation Semantics. LACL 2005: 101-113 - 2003
- [j46]Yaroslav Fyodorov, Yoad Winter, Nissim Francez:
Order-Based Inference in Natural Logic. Log. J. IGPL 11(4): 385-416 (2003) - [j45]Nissim Francez, Michael Kaminski:
An algebraic characterization of deterministic regular languages over infinite alphabets. Theor. Comput. Sci. 306(1-3): 155-175 (2003) - 2002
- [c47]Efrat Jaeger, Nissim Francez, Shuly Wintner:
Guaranteeing Parsing Termination of Unification Grammars. COLING 2002 - 2000
- [j44]Rani Nelken, Nissim Francez:
The Algebraic Semantics of Interrogative NPs. Grammars 3(2/3): 259-273 (2000) - [c46]Rani Nelken, Nissim Francez:
Querying Temporal Databases Using Controlled Natural Language. COLING 2000: 1076-1080
1990 – 1999
- 1999
- [j43]Rachel Ben-Eliyahu-Zohary, Nissim Francez, Michael Kaminski:
Similarity Preservation in Default Logic. Ann. Math. Artif. Intell. 25(1-2): 137-160 (1999) - [j42]Shuly Wintner, Nissim Francez:
Off-Line Parsability and the Well-Foundedness of Subsumption. J. Log. Lang. Inf. 8(1): 1-16 (1999) - 1998
- [j41]Shmuel Sagiv, Nissim Francez, Michael Rodeh, Reinhard Wilhelm:
A Logic-Based Approach to Program Flow Analysis. Acta Informatica 35(6): 457-504 (1998) - [c45]Evgeniy Gabrilovich, Nissim Francez, Shuly Wintner:
System Demonstration Natural Language Generation With Abstract Machine. INLG 1998 - [c44]Nissim Francez:
Hypothetical Reasoning and Basic Non-constituent Coordination in Type-Logical Grammar. LACL 1998: 31-47 - [c43]Frank S. de Boer, Nissim Francez, M. van Hulst, Frank A. Stomp:
A proof theory of asynchronously communicating sequential processes. PROCOMET 1998: 49-67 - 1997
- [j40]Rani Nelken, Nissim Francez:
Splitting the Reference Time: The Analogy between Nominal and Temporal Anaphora Revisited1. J. Semant. 14(4): 369-416 (1997) - [c42]Nissim Francez:
On Fibring Feature Logics with Concatenation Logics. LACL 1997: 200-211 - [i7]Shuly Wintner, Nissim Francez:
Off-line Parsability and the Well-foundedness of Subsumption. CoRR cmp-lg/9709011 (1997) - [i6]Shuly Wintner, Evgeniy Gabrilovich, Nissim Francez:
Amalia - A Unified Platform for Parsing and Generation. CoRR cmp-lg/9709014 (1997) - 1996
- [b3]Nissim Francez, Ira R. Forman:
Interacting processes - a multiparty approach to coordinated distributed processing. Addison-Wesley 1996, ISBN 978-0-201-56528-7, pp. I-XIV, 1-234 - [c41]Rani Nelken, Nissim Francez:
Automatic Translation of Natural Language System Specifications. CAV 1996: 360-371 - [i5]Shuly Wintner, Nissim Francez:
Parsing with Typed Feature Structures. CoRR cmp-lg/9601010 (1996) - [i4]Shuly Wintner, Nissim Francez:
Parsing with Typed Feature Structures. CoRR cmp-lg/9601011 (1996) - 1995
- [j39]Nissim Francez:
Contrastive Logic. Log. J. IGPL 3(5): 725-744 (1995) - [c40]Rani Nelken, Nissim Francez:
Splitting the Reference Time: Temporal Anaphora and Quantification in DRT. EACL 1995: 261-266 - [c39]Shuly Wintner, Nissim Francez:
Parsing with Typed Feature Structures. IWPT 1995: 273-287 - [i3]Rani Nelken, Nissim Francez:
Splitting the Reference Time: Temporal Anaphora and Quantification in DRT. CoRR cmp-lg/9502023 (1995) - [i2]Shuly Wintner, Nissim Francez:
Abstract Machine for Typed Feature Structures. CoRR cmp-lg/9504009 (1995) - 1994
- [j38]Yael Shemesh, Nissim Francez:
Finite-State Unification Automata and Relational Languages. Inf. Comput. 114(2): 192-213 (1994) - [j37]Sara Porat, Nissim Francez:
Fairness in term rewriting systems. Methods Log. Comput. Sci. 1(2): 141-181 (1994) - [j36]Limor Fix, Nissim Francez, Orna Grumberg:
Program Composition via Unification. Theor. Comput. Sci. 131(1): 139-179 (1994) - [j35]Michael Kaminski, Nissim Francez:
Finite-Memory Automata. Theor. Comput. Sci. 134(2): 329-363 (1994) - [i1]Shuly Wintner, Nissim Francez:
Abstract Machine for Typed Feature Structures. CoRR abs/cmp-lg/9407014 (1994) - 1993
- [j34]Paul C. Attie, Nissim Francez, Orna Grumberg:
Fairness and Hyperfairness in Multi-Party Interactions. Distributed Comput. 6(4): 245-254 (1993) - 1992
- [b2]Nissim Francez:
Program verification. International computer science series, Addison-Wesley 1992, ISBN 978-0-201-41608-4, pp. I-XI, 1-312 - [j33]Nissim Francez, Ralph-Johan Back, Reino Kurki-Suonio:
On Equivalence-Completions of Fairness Assumtions. Formal Aspects Comput. 4(6): 582-591 (1992) - [c38]Limor Fix, Nissim Francez, Orna Grumberg:
Program Composition via Unification. ICALP 1992: 672-684 - [c37]Jean-Michel Couvreur, Nissim Francez, Mohamed G. Gouda:
Asynchronous Unison (Extended Abstract). ICDCS 1992: 486-493 - 1991
- [j32]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): 141-142 (1991) - [c36]Nissim Francez, Ira R. Forman:
Synchrony Loosening Transformations for Interacting Processes. CONCUR 1991: 203-219 - [c35]Limor Fix, Nissim Francez, Orna Grumberg:
Program Composition and Modular Verification. ICALP 1991: 93-114 - 1990
- [j31]Nissim Francez:
Corrigenda: Cooperating Proofs for Distributed Programs with Multiparty Interactions. Inf. Process. Lett. 34(1): 57 (1990) - [j30]Nissim Francez:
Corrigenda: Cooperating Proofs for Distributed Programs with Multiparty Interactions. Inf. Process. Lett. 35(5): 275 (1990) - [c34]Nissim Francez, Ira R. Forman:
Superimposition for Interacting Processes. CONCUR 1990: 230-245 - [c33]Nissim Francez:
Distributed Logic Programming. Dagstuhl Seminar on Parallelization in Inference Systems 1990: 356 - [c32]Michael Kaminski, Nissim Francez:
Finite-Memory Automata (Extended Abstract). FOCS 1990: 683-688 - [c31]Nissim Francez, Ira R. Forman:
Conflict Propogation. ICCL 1990: 155-168 - [c30]Limor Fix, Nissim Francez, Orna Grumberg:
Sematics-Driven Decompositions for the Verification of Distributed Programs. Programming Concepts and Methods 1990: 101-124 - [c29]Nissim Francez, Ira R. Forman:
Interacting processes: a language for coordinated distributed programming. Jerusalem Conference on Information Technology 1990: 146-161 - [c28]Amir Rahat, Nissim Francez, Oded Shmueli:
On the Equivalence of Deferred Substitution and Immediate Substitution Semantics for Logic Programs. JELIA 1990: 454-471 - [c27]Shmuel Sagiv, Nissim Francez, Michael Rodeh, Reinhard Wilhelm:
A Logic-Based Approach to Data Flow Analysis Problem. PLILP 1990: 277-292 - [c26]Paul C. Attie, Nissim Francez, Orna Grumberg:
Fairness and Hyperfairness in Multi-Party Interactions. POPL 1990: 292-305
1980 – 1989
- 1989
- [j29]Sara Porat, Nissim Francez:
Fairness in Context-Free Grammars under Every Choice-strategy. Inf. Comput. 80(3): 249-268 (1989) - [j28]Nissim Francez:
Cooperating Proofs for Distributed Programs with Multiparty Interactions. Inf. Process. Lett. 32(5): 235-242 (1989) - [j27]Michael Evangelist, Nissim Francez, Shmuel Katz:
Multiparty Interactions for Interprocess Communication and Synchronization. IEEE Trans. Software Eng. 15(11): 1417-1426 (1989) - [c25]Shmuel Sagiv, Orit Edelstein, Nissim Francez, Michael Rodeh:
Resolving Circularity in Attribute Grammars with Applications to Data Flow Analysis. POPL 1989: 36-48 - 1988
- [j26]Krzysztof R. Apt, Nissim Francez, Shmuel Katz:
Appraising Fairness in Languages for Distributed Programming. Distributed Comput. 2(4): 226-241 (1988) - [j25]Ran Rinat, Nissim Francez, Orna Grumberg:
Infinite Trees, Markings and Well-Foundedness. Inf. Comput. 79(2): 131-154 (1988) - [c24]Luc Bougé, Nissim Francez:
A Compositional Approach to Superimposition. POPL 1988: 240-249 - 1987
- [j24]Nissim Francez, Shmuel Katz:
Fairness and the axioms of control predicates. Int. J. Parallel Program. 16(4): 263-278 (1987) - [c23]Krzysztof R. Apt, Nissim Francez, Shmuel Katz:
Appraising Fairness in Languages for Distributed Programming. POPL 1987: 189-198 - 1986
- [b1]Nissim Francez:
Fairness. Texts and Monographs in Computer Science, Springer 1986, ISBN 978-3-540-96235-9, pp. I-XIII, 1-295 - [j23]Orna Grumberg, Nissim Francez, Shmuel Katz:
A Complete Rule for Equifair Termination. J. Comput. Syst. Sci. 33(3): 313-332 (1986) - [j22]Nissim Francez, Brent Hailpern, Gadi Taubenfeld:
Script: A Communication Abstraction Mechanism and Its Verification. Sci. Comput. Program. 6(1): 35-88 (1986) - [c22]Ran Rinat, Nissim Francez, Orna Grumberg:
Infinite Trees, Markings and Well Foundedness. CAAP 1986: 238-253 - [c21]Sara Porat, Nissim Francez:
Full-Commutation and Fair-Termination in Equational (and Combined) Term-Rewriting Systems. CADE 1986: 21-41 - [c20]Nir Shavit, Nissim Francez:
A New Approach to Detection of Locally Indicative Stability. ICALP 1986: 344-358 - 1985
- [j21]Orna Grumberg, Nissim Francez, Johann A. Makowsky, Willem P. de Roever:
A Proof Rule for Fair Termination of Guarded Commands. Inf. Control. 66(1/2): 83-102 (1985) - [j20]Nissim Francez, Brent Hailpern:
Script: A Communication Abstraction Mechanism. ACM SIGOPS Oper. Syst. Rev. 19(2): 53-67 (1985) - [j19]Nissim Francez, Shaula Yemini:
Symmetric Intertask Communication. ACM Trans. Program. Lang. Syst. 7(4): 622-636 (1985) - [c19]Nissim Francez, Orna Grumberg, Shmuel Katz, Amir Pnueli:
Proving Termination of Prolog Programs. Logic of Programs 1985: 89-105 - [c18]Sara Porat, Nissim Francez:
Fairness in Term Rewriting Systems. RTA 1985: 287-300 - [c17]Sara Porat, Nissim Francez:
Fairness in Context-Free Grammars under Canonical Derivations. STACS 1985: 255-266 - [c16]Nissim Francez, Shalom Goldenberg, Ron Y. Pinter, Michael L. Tiomkin, Shalom Tsur:
An environment for logic programming. SLIPE 1985: 179-190 - 1984
- [j18]A. Prasad Sistla, Edmund M. Clarke, Nissim Francez, Albert R. Meyer:
Can Message Buffers Be Axiomatized in Linear Temporal Logic? Inf. Control. 63(1/2): 88-112 (1984) - [j17]Tzilla Elrad, Nissim Francez:
A Weakest Precondition Semantics for Communicating Processes. Theor. Comput. Sci. 29: 231-250 (1984) - [j16]Nissim Francez, Daniel Lehmann, Amir Pnueli:
A Linear-History Semantics for Languages for Distributed Programming. Theor. Comput. Sci. 32: 25-46 (1984) - [j15]