Nissim Francez

Q: What Schools Are Affiliated With Nissim Francez

Nissim Francez is affiliated with the following schools: Bar-Ilan University, Weizmann Institute of Science, Tel Aviv University, Hebrew University of Jerusalem

Nissim Francez's AcademicInfluence.com Rankings

Nissim Francez

Computer Science

#1606

World Rank

#1661

Historical Rank

Database

#7317

World Rank

#7577

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Nissim Francez Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Nissim Francez is an Israeli professor, emeritus in the computer science faculty at the Technion, and former head of computational linguistics laboratory in the faculty. Early life and education Nissim Francez was born in Bulgaria. His family emigrated to Israel in 1949. He received his B.Sc. in mathematics and philosophy from the Hebrew University, Jerusalem in 1965. After his military service in the IDF, he studied at the Department of Applied Mathematics at the Weizmann Institute, Rehovot, and received his M.sc. in 1971.

(See a Problem?)

Nissim Francez's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Finite-memory automata (1990) (416)
A Proof System for Communicating Sequential Processes (1980) (367)
Distributed Termination (1980) (254)
Decomposition of Distributed Programs into Communication-Closed Layers (1982) (234)
Basic simple type theory (1998) (139)
Achieving Distributed Termination without Freezing (1982) (114)
A compositional approach to superimposition (1988) (105)
Semantics of Nondeterminism, Concurrency, and Communication (1979) (102)
Appraising fairness in languages for distributed programming (1988) (93)
Proof-theoretic semantics for a natural language fragment (2007) (82)
A Proof Rule for Fair Termination of Guarded Commands (1985) (75)
Interacting processes: a multiparty approach to coordinated distributed programming (1996) (75)
Program verification (1992) (68)
Temporal Prepositions and Temporal Generalized Quantifiers (2001) (67)
A Note on Harmony (2012) (60)
A Linear-History Semantics for Languages for Distributed Programming (1984) (59)
A New Approach to Detection of Locally Indicative Stability (1986) (58)
Script: A Communication Abstraction Mechanism and Its Verification (1989) (57)
A distributed abstract data type implemented by a probabilistic communication scheme (1980) (54)
Asynchronous unison (1992) (54)
E-type pronouns, i-sums, and donkey anaphora (1994) (53)
Multiparty Interactions for Interprocess Communication and Synchronization (1989) (50)
Fairness and hyperfairness in multi-party interactions (1989) (47)
Superimposition for Interacting Processes (1990) (47)
Proof-Theoretic Semantics for Subsentential Phrases (2010) (43)
Script: A communication abstraction mechanism (1983) (42)
Generalized fair termination (1984) (40)
Distributed k-selection: From a sequential to a distributed algorithm (1983) (38)
Asynchronous Unison (Extended Abstract). (1992) (38)
Order-Based Inference in Natural Logic (2003) (35)
Automatic Translation of Natural Language System Specifications into Temporal Logic (1996) (35)
Bilattices and the Semantics of Natural Language Questions (2002) (34)
Can Message Buffers Be Axiomatized in Linear Temporal Logic? (1986) (31)
A ‘Natural Logic’ inference system using the Lambek calculus (2006) (30)
Modeling the distributed termination convention of CSP (1984) (28)
An algebraic characterization of deterministic regular languages over infinite alphabets (2003) (27)
Proving Termination of Prolog Programs (1985) (27)
A proof method for cyclic programs (1978) (26)
Querying Temporal Databases Using Controlled Natural Language (2000) (25)
Finite-State Unification Automata and Relational Languages (1994) (25)
Automatic Translation of Natural Language System Specifications (1996) (24)
Views of proof-theoretic semantics: reified proof-theoretic meanings (2016) (23)
Abstract Machine for Typed Feature Structures (1994) (22)
Corrigenda: Cooperating Proofs for Distributed Programs with Multiparty Interactions (1989) (22)
A Logic-Based Approach to Data Flow Analysis Problem (1990) (22)
Fair termination of communicating processes (1984) (21)
Proof-Theoretic Reconstruction of Generalized Quantifiers (2015) (20)
Symmetric intertask communication (1985) (18)
Parsing with Typed Feature Structures (1996) (18)
PROOF-THEORETIC SEMANTIC VALUES FOR LOGICAL OPERATORS (2011) (18)
Commutation-Augmented Pregroup Grammars and Mildly Context-Sensitive Languages (2007) (17)
Unification Grammars and Off-Line Parsability (2005) (16)
A Weakest Precondition Semantics for Communicating Processes (1982) (16)
Can message buffers be characterized in linear temporal logic? (1982) (16)
Splitting the Reference Time: The Analogy between Nominal and Temporal Anaphora Revisited1 (1997) (14)
Script: a communication abstraction mechanism (1985) (13)
Bilateralism in Proof-Theoretic Semantics (2014) (13)
Full-Commutation and Fair-Termination in Equational (and Combined) Term-Rewriting Systems (1986) (13)
Preserving Liveness: Comments on "Safety and Liveness from a Methodological Point of View" (1991) (13)
Verb-Phrase Ellipsis in Dynamic Semantics (1995) (12)
Extended naming conventions for communicating processes (1982) (12)
Categorial grammar and the semantics of contextual prepositional phrases (2006) (12)
Fairness in term rewriting systems (1985) (12)
A linear history semantics for distributed languages extended abstract (1980) (11)
Unification Grammars (2011) (11)
Amalia - A Unified Platform for Parsing and Generation (1997) (11)
Program Composition and Modular Verification (1991) (11)
A logic-based approach to program flow analysis (1998) (11)
An environment for logic programming (1985) (11)
Synchrony Loosening Transformations for Interacting Processes (1991) (10)
Off-Line Parsability and the Well-Foundedness of Subsumption (1997) (10)
Resolving circularity in attribute grammars with applications to data flow analysis (preliminary version) (1989) (10)
An Experimental Implementation of CSP (1981) (10)
Interacting processes: a language for coordinated distributed programming (1990) (10)
An Application of a Method for Analysis of Cyclic Prog rams (1978) (10)
ON THE NOTION OF CANONICAL DERIVATIONS FROM OPEN ASSUMPTIONS AND ITS ROLE IN PROOF-THEORETIC SEMANTICS (2015) (9)
On Achieving Distributed Termination (1979) (9)
Relational Semantics of the Lambek Calculus Extended with Classical Propositional Logic (2014) (9)
A Compete Proof Rule for Strong Equifair Termination (1983) (9)
Categorial Grammar with Ontology-refined Types (2004) (9)
A Logic Inspired by Natural Language: Quantifiers As Subnectors (2014) (8)
Natural Deduction for Two Connexive Logics. (2016) (8)
Splitting the Reference Time: Temporal Anaphora and Quantification in DRT (1995) (8)
Interacting processes - a multiparty approach to coordinated distributed processing (1996) (8)
Product properties and their direct verification (1983) (8)
The Algebraic Semantics of Interrogative NPs (2000) (8)
Contrastive Logic (1995) (7)
A Case for a Forward Predicate Transformer (1977) (7)
On the Semantics of Temporal Prepositions and Preposition Phrases (2007) (7)
The Lambek Calculus Extended with Intuitionistic Propositional Logic (2016) (7)
Conflict propagation (1990) (6)
A proof-theoretic semantics for contextual domain restriction (2015) (6)
Fair Deriviations in Context-Free Grammars (1982) (6)
Harmony in Multiple-Conclusion Natural-Deduction (2014) (6)
On harmony and permuting conversions (2017) (6)
On equivalence-completions of fairness assumptions (1992) (6)
On Poly-logistic Natural-deduction for Finitely-valued Propositional Logics (2019) (5)
Procedural dynamic semantics, verb-phrase ellipsis, and presupposition (1993) (5)
On distinguishing proof-theoretic consequence from derivability (2017) (5)
Another Advantage of Keyword Notation for Parameter Communication with Subprograms (1977) (5)
Proof-Theoretic Semantics for Intensional Transitive Verbs (2016) (5)
Eecient Implementation of Uniication-based Grammars (1999) (5)
The Granularity of Meaning in Proof-Theoretic Semantics (2014) (5)
Semantics of Nondeterminism, Concurrency and Communication (Extended Abstract) (1978) (5)
Infinite Trees, Markings and Well-Foundedness (1988) (5)
Relevant Connexive Logic (2019) (5)
A Poly-Connexive Logic (2019) (4)
Toward a generalization of the logic of grounding (2020) (4)
A Complete Rule for Equifair Termination (1986) (4)
Corrigendum: “Distributed Termination” (1980) (4)
Finite-Memory Automata (Extended Abstract) (1990) (4)
A Calculus for Interrogatives Based on Their Algebraic Semantics (2007) (4)
Relevant harmony (2016) (4)
On the direction of fibring feature logics with concatenation logics (1997) (3)
On Fibring Feature Logics with Concatenation Logics (1997) (3)
Unification Grammars: Conclusion (2011) (3)
A Proof-Theoretic Semantics for Transitive Verbs with an Implicit Object (2017) (3)
On Beall’s New Interpretation of $$WK_{3}$$WK3 (2018) (3)
Diversification of Object-Languages for Propositional Logics (2018) (3)
A methodology for verifying request processing protocols (1983) (3)
Program Composition via Unification (1992) (3)
Similarity preservation in default logic (1999) (3)
Bilaterilism does Provide a Proof Theoretic Treatment of Classical Logic (for non-technical reasons) (2018) (3)
Guaranteeing Parsing Termination of Unification Grammars (2002) (3)
Pushdown automata with cancellation and commutation-augmented pregroups grammars (2007) (2)
Bilateralism, Trilateralism, Multilateralism and Poly-Sequents (2019) (2)
BILATERAL RELEVANT LOGIC (2014) (2)
Plurality and Temporal Modification (2006) (2)
Another plan for negation (2019) (2)
A Proof Theory for First-order Logic with Definiteness (2017) (2)
Poly-Connexivity: Connexive Conjunction and Disjunction (2022) (2)
Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars (2010) (2)
Structural Rules for Multi-valued Logics (2019) (2)
Calculi for Many-Valued Logics (2021) (2)
A Proof-Theoretic Semantics for Adjectival Modification (2017) (2)
Fairness in Context-Free Grammars under Canonical Derivations (1985) (2)
Game Semantics for the Lambek-Calculus: Capturing Directionality and the Absence of Structural Rules (2008) (2)
Infinite Trees, Markings and Well Foundedness (1986) (2)
Unification Grammars: Acknowledgments (2011) (1)
Proof-Theoretic Semantics for Natural Language (2019) (1)
Natural Language Generation with Abstract Machine (1998) (1)
On a Distinction of Two Facets of Meaning and its Role in Proof-theoretic Semantics (2015) (1)
Commutation-augmented pregroup grammars and push-down automata with cancellation (2008) (1)
Extending Free Pregroups with Lower Bounds (2010) (1)
Transparent truth-value predicates in multi-valued logics (2019) (1)
Fairness in Context-Free Grammars under Every Choice-strategy (1989) (1)
Sematics-Driven Decompositions for the Verification of Distributed Programs (1990) (1)
Proof Rules for Dynamic Process Creation and Destruction Proof Rules for Dynamic Process Creation and Destruction Proof Rules Tor Dynamic Process Creation and Destruction , Proof Rules Tor Dynamic Process Creation and Destruction (1)
Position paper : Proof-Theoretic Semantics as a viable alternative to Model-Theoretic Semantics for natural language (2014) (1)
Unification Grammars: Unification grammars (2011) (1)
Backtracking in recursive computations (1977) (1)
Fairness and the axioms of control predicates (1987) (1)
The “ lost ” reading of control sentences and plural semantics in Glue Genady Beryozkin and (2004) (1)
Unification Grammars: List of symbols (2011) (0)
Extension and Generalizations of Fairness (1986) (0)
System Demonstration Natural Language Generation With Abstract Machine (1998) (0)
The Functional Approach (1986) (0)
Unification Grammars: Unification (2011) (0)
A Logic Inspired by Natural Language: Quantifiers As Subnectors (2014) (0)
7 Conclusions and Further Research Acknowledgements We like to Thank the Calculi for Distributed Program Construction Club Headed by Lambert Meertens and Doaitse Swierstra and the Formal Models Club at Utrecht University. We Also Want to Acknowledge (2007) (0)
Connexive Restricted Quantification (2020) (0)
Proof-theoretic semantics as a resource for expressing semantic variability (2022) (0)
Splitting the Reference Time: Temporal Anaphora and Quantiication in Drt -technical Report (2011) (0)
Proof Rules for Communication Abstractions (Abstract) (1984) (0)
A proof-theoretic universal property of determiners (2015) (0)
~OMMUTATION AND FAIE-TEEMINATION IN EQUATIONAL (AND COMBINED) ~-REWRITING SYSTEMS (0)
On the semantics of temporal prepositions and prepositionphrasesIan Pratt and (2011) (0)
A proof theory of asynchronously communicating sequential processes (1998) (0)
DE MORGAN INTERPRETATION OF THE LAMBEK–GRISHIN CALCULUS (2020) (0)
The Method of Explicit Scheduler (1986) (0)
Solutions to selected exercises (2011) (0)
Proof-theoretic type interpretation : a glimpse to proof-theoretic semantics (2012) (0)
Bilateralism based on Corrective Denial (2021) (0)
680 ACKNOWLEDGMENT Fiona Cowie Max Cresswell Mark Crimmins (1999) (0)
SPLITTING THE REFERENCE (1995) (0)
Hypothetical-reasoning and radical non-constituent coordination in categorial logic (1997) (0)
Unification Grammars: Introduction (2011) (0)
Harmony in Multiple-Conclusion Natural-Deduction (2014) (0)
Unification Grammars: Linguistic applications (2011) (0)
Hypothetical Reasoning and Basic Non-constituent Coordination in Type-Logical Grammar (1998) (0)
S U R F a C E -c O M P O S I T I O N a L S C O P E -a L T E R N a T I O N (2009) (0)
Logical Grounding: The Case of “ if‐then‐else” (2021) (0)
When are different type-logical semantic definitions defining equivalent meanings? (2012) (0)
Unification Grammars: Feature structures (2011) (0)
The Method of Helpful Directions (1986) (0)
Relational Semantics of the Lambek Calculus Extended with Classical Propositional Logic (2013) (0)
On the Role of Aristotle's Connexive Axioms in Non-connexive Logics (2021) (0)
A Proof-Theoretic Semantics for Exclusion (2017) (0)
Bilateralism in Proof-Theoretic Semantics (2013) (0)
A Decidable Temporal Logic for Temporal Prepositions (2000) (0)
Distributed Logic Programming (1990) (0)
Unification Grammars: Computational aspects of unification grammars (2011) (0)
A Proof-Theoretic Semantics for Exclusion (2017) (0)
782 ACKNOWLEDGMENT Veneeta Dayal Regine Eckardt Paul Elbourne (2003) (0)
A Note on Harmony (2011) (0)
A generalization of falsity in finitely-many valued logics (2022) (0)
A Proof-Theoretic Semantics for Adjectival Modification (2016) (0)
Does the Implication Elimination Rule Need a Minor Premise (2017) (0)
reviewed hyJunusz Zulewski, (Jniversity of Central Florida (1996) (0)
Calculi for Many-Valued Logics (2021) (0)
Acknowledgement to referees (2005) (0)
Lambek-Calculus with General Elimination Rules and Continuation Semantics (2005) (0)
Fail Termination of Communicating Processe. (1984) (0)
Abstract Machine for Linguistic Applications User's Guide (1998) (0)
Towards a generalization of the logic of grounding* (Hacia una generalización de la lógica de la fundamentación) (2020) (0)
Fairness in Temporal Logic (1986) (0)
On the Equivalence of Deferred Substitution and Immediate Substitution Semantics for Logic Programs (1990) (0)
Preliminary mathematical notions (2011) (0)
Prepositions and context (2002) (0)
On the semantics of temporal prepositions and (2018) (0)
Proof-Theoretic Semantics for Natural Language (2019) (0)
Diversification of Object-Languages for Propositional Logics (2018) (0)
Editors’ Preface (2012) (0)
A Generalized Definition of Quantifier Absorption (1996) (0)
Termination and Well-Foundedness (1986) (0)
On a Distinction of Two Facets of Meaning and its Role in Proof-theoretic Semantics (2015) (0)
Unification Grammars: Bibliography (2011) (0)
On the Non-Compactness of the Class of Program Schemas (1973) (0)
Structural Rules for Multi-valued Logics (2019) (0)
Editors’ Preface (2012) (0)
Fair Termination of Concurrent Processes (1986) (0)
A decidable logic for temporal prepositions (2000) (0)
Bilateralism, Trilateralism, Multilateralism and Poly-Sequents (2018) (0)
The Lambek Calculus Extended with Intuitionistic Propositional Logic (2016) (0)

This paper list is powered by the following services:

Other Resources About Nissim Francez

en.wikipedia.org

What Schools Are Affiliated With Nissim Francez?

Nissim Francez is affiliated with the following schools: