Michael Kaminski

Publication Activity (10 Years)

Years Active: 1981-2023
Publications (10 Years): 14

Top Topics

Propositional Logic

Automata Theoretic

Proof Procedure

Top Venues

Logica Universalis

IEEE Trans. Inf. Theory

Publications

Michael Kaminski, Igor E. Shparlinski, Michel Waldschmidt
On sets of linear forms of maximal complexity. Comput. Complex. 32 (1) (2023)
Michael Kaminski
Extending the Lambek Calculus with Classical Negation. Stud Logica 110 (2) (2022)
Michael Kaminski
A Note on Calculi for Non-deterministic Many-valued Logics. Fundam. Informaticae 186 (1-4) (2022)
Michael Kaminski, Igor E. Shparlinski
Sets of Linear Forms Which Are Hard to Compute. MFCS (2021)
Michael Kaminski
A note on calculi for non-deterministic many-valued logics. CoRR (2021)
Michael Kaminski, Igor E. Shparlinski, Michel Waldschmidt
On sets of linear forms of maximal complexity. CoRR (2021)
Michael Kaminski, Nissim Francez
Calculi for Many-Valued Logics. Logica Universalis 15 (2) (2021)
Michael Kaminski, Nissim Francez
De Morgan Interpretation of the Lambek-Grishin Calculus. Rev. Symb. Log. 13 (4) (2020)
Nissim Francez, Michael Kaminski
On Poly-logistic Natural-deduction for Finitely-valued Propositional Logics. FLAP 6 (2) (2019)
Nissim Francez, Michael Kaminski
Structural Rules for Multi-valued Logics. Logica Universalis 13 (1) (2019)
Daniel Genkin, Michael Kaminski, Liat Peterfreund
Closure Under Reversal of Languages over Infinite Alphabets. CSR (2018)
Nissim Francez, Michael Kaminski
A Proof-Theoretic Semantics for Exclusion. Logica Universalis 11 (4) (2017)
Michael Kaminski, Nissim Francez
The Lambek Calculus Extended with Intuitionistic Propositional Logic. Stud Logica 104 (5) (2016)
Tamar Aizikowitz, Michael Kaminski
LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata. J. Comput. Syst. Sci. 82 (8) (2016)
Tamar Aizikowitz, Michael Kaminski
Linear Conjunctive Grammars and One-turn Synchronized Alternating Pushdown Automata. Int. J. Found. Comput. Sci. 25 (6) (2014)
Daniel Genkin, Michael Kaminski, Liat Peterfreund
A note on the emptiness problem for alternating finite-memory automata. Theor. Comput. Sci. 526 (2014)
Michael Kaminski, Nissim Francez
Relational Semantics of the Lambek Calculus Extended with Classical Propositional Logic. Stud Logica 102 (3) (2014)
Michael Kaminski, Chaoping Xing
An Upper Bound on the Complexity of Multiplication of Polynomials Modulo a Power of an Irreducible Polynomial. IEEE Trans. Inf. Theory 59 (10) (2013)
Tamar Aizikowitz, Michael Kaminski
Conjunctive grammars and alternating pushdown automata. Acta Informatica 50 (3) (2013)
Tamar Aizikowitz, Michael Kaminski
(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata. CSR (2011)
Michael Kaminski, Simone Martini
CSL 2008 special issue. ACM Trans. Comput. Log. 11 (4) (2010)
Daniel Genkin, Nissim Francez, Michael Kaminski
Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars. Essays in Memory of Amir Pnueli (2010)
Michael Kaminski, Tony Tan
A Note on Two-pebble Automata Over Infinite Alphabets. Fundam. Informaticae 98 (4) (2010)
Tamar Aizikowitz, Nissim Francez, Daniel Genkin, Michael Kaminski
Extending Free Pregroups with Lower Bounds. Stud Logica 95 (3) (2010)
Michael Kaminski, Daniel Zeitlin
Finite-Memory Automata with Non-Deterministic Reassignment. Int. J. Found. Comput. Sci. 21 (5) (2010)
Yulia Dubov, Michael Kaminski
The Power of Non-deterministic Reassignment in Infinite-Alphabet Pushdown Automata. Languages: From Formal to Natural (2009)
Tamar Aizikowitz, Michael Kaminski
Linear Conjunctive Grammars and One-Turn Synchronized Alternating Pushdown Automata. FG (2009)
Michael Kaminski
Invariance Under Stuttering in a Temporal Logic without the "Until" Operator. Fundam. Informaticae 82 (1-2) (2008)
Ariel Cohen, Michael Kaminski, Johann A. Makowsky
Notions of Sameness by Default and their Application to Anaphora, Vagueness, and Uncertain Reasoning. J. Log. Lang. Inf. 17 (3) (2008)
Michael Kaminski, Miroslaw Truszczynski
Preface. Ann. Math. Artif. Intell. 53 (1-4) (2008)
Michael Kaminski
A non-preferential semantics of non-monotonic modal logic. Ann. Math. Artif. Intell. 53 (1-4) (2008)
Nissim Francez, Michael Kaminski
Commutation-augmented pregroup grammars and push-down automata with cancellation. Inf. Comput. 206 (9-10) (2008)
Michael Kaminski, Tony Tan
Tree Automata over Infinite Alphabets. Pillars of Computer Science (2008)
Michael Kaminski, Daniel Zeitlin
Extending finite-memory automata with non-deterministic reassignment (Extended abstract). AFL (2008)
Benjamin Grimberg, Michael Kaminski
First-Order Ground Non-Monotonic Modal Logic. Fundam. Informaticae 83 (3) (2008)
Tamar Aizikowitz, Michael Kaminski
Conjunctive Grammars and Alternating Pushdown Automata. WoLLIC (2008)
Michael Kaminski
A Non-Preferential Semantics of Non-Monotonic Modal Logic. ISAIM (2008)
Nissim Francez, Michael Kaminski
Commutation-Augmented Pregroup Grammars and Mildly Context-Sensitive Languages. Stud Logica 87 (2-3) (2007)
Michael Kaminski, Michael L. Tiomkin
The Modal Logic of Cluster-Decomposable Kripke Interpretations. Notre Dame J. Formal Log. 48 (4) (2007)
Nissim Francez, Michael Kaminski
Pushdown automata with cancellation and commutation-augmented pregroups grammars. LATA (2007)
Michael Kaminski
Preface. Ann. Math. Artif. Intell. 48 (3-4) (2006)
Nader H. Bshouty, Michael Kaminski
Polynomial multiplication over finite fields: from quadratic to straight-line complexity. Comput. Complex. 15 (3) (2006)
Michael Kaminski, Tony Tan
Regular Expressions for Languages over Infinite Alphabets. Fundam. Informaticae 69 (3) (2006)
Michael Kaminski
Invariance under stuttering in a temporal logic of actions. Theor. Comput. Sci. 368 (1-2) (2006)
Michael Kaminski, Julia Rubin-Mosin
Default theories over monadic languages. Theor. Comput. Sci. 364 (2) (2006)
Michael Kaminski
Complexity of Polynomial Multiplication over Finite Fields. CSR (2006)
Michael Kaminski
A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields. SIAM J. Comput. 34 (4) (2005)
Michael Kaminski
A Lower Bound on the Complexity of Polynomial Multiplication Over Finite Fields. STACS (2005)
Ariel Cohen, Michael Kaminski, Johann A. Makowsky
Indistinguishability by Default. We Will Show Them! (1) (2005)
Michael Kaminski, Julia Mosin
Default Theories Over Monadic Languages: (Extended Abstract). Electron. Notes Theor. Comput. Sci. 123 (2005)
Michael Kaminski, Tony Tan
Regular Expressions for Languages over Infinite Alphabets. COCOON (2004)
Nissim Francez, Michael Kaminski
An algebraic characterization of deterministic regular languages over infinite alphabets. Theor. Comput. Sci. 306 (1-3) (2003)
Michael Kaminski, Yael Yariv
A Real-time Semantics of Temporal Logic of Actions. J. Log. Comput. 13 (6) (2003)
Michael Kaminski, Guy Rey
Revisiting quantification in autoepistemic logic. ACM Trans. Comput. Log. 3 (4) (2002)
Arkadi Estrin, Michael Kaminski
The Expressive Power of Temporal Logic of Actions. J. Log. Comput. 12 (5) (2002)
Michael Kaminski, Guy Rey
First-order Non-monotonic Modal Logics. Fundam. Informaticae 42 (3-4) (2000)
Michael Kaminski
Open Default Theories over Closed Domains. ESCQARU (1999)
Rachel Ben-Eliyahu-Zohary, Nissim Francez, Michael Kaminski
Similarity Preservation in Default Logic. Ann. Math. Artif. Intell. 25 (1-2) (1999)
Arkadi Estrin, Michael Kaminski
The Expressive Power of Temporal Logic of Actions (Extended Abstract). CONCUR (1999)
Michael Kaminski
Open Default Theories over Closed Domains. Log. J. IGPL 7 (5) (1999)
Michael Kaminski, Johann A. Makowsky, Michael L. Tiomkin
Extensions for Open Default Theories via the Domain Closure Assumption. J. Log. Comput. 8 (2) (1998)
Edward Y. C. Cheng, Michael Kaminski
Context-Free Languages over Infinite Alphabets. Acta Informatica 35 (3) (1998)
Siu-Wing Cheng, Michael Kaminski, Shmuel Zaks
Minimum Dominating Sets of Intervals on Lines. Algorithmica 20 (3) (1998)
Michael Kaminski
The elimination of de re formulas. J. Philos. Log. 26 (4) (1997)
Michael Kaminski
A Note on the Stable Model Semantics for Logic Programs. (Research Note). Artif. Intell. 96 (2) (1997)
Michael Kaminski, Michael L. Tiomkin
The Expressive Power of Second-Order Propositional Modal Logic. Notre Dame J. Formal Log. 37 (1) (1996)
Michael Kaminski, Chung Kei Wong
The Power of the "Always" Operator in First-Order Temporal Logic. Theor. Comput. Sci. 160 (1&2) (1996)
Michael Kaminski, Johann A. Makowsky, Michael L. Tiomkin
Extensions for Open Default Theories via the Domain Closure Assumption. JELIA (1996)
Michael Kaminski
A Comparative Study of Open Default Theories. Artif. Intell. 77 (2) (1995)
Siu-Wing Cheng, Michael Kaminski, Shmuel Zaks
Minimum Dominating Sets of Intervals on Lines (Extended Abstract). COCOON (1995)
Michael L. Tiomkin, Michael Kaminski
Semantical Analysis of Logic of Actions. J. Log. Comput. 5 (2) (1995)
Michael Kaminski
A Branching Time Logic with Past Operators. J. Comput. Syst. Sci. 49 (2) (1994)
Michael Kaminski, Nissim Francez
Finite-Memory Automata. Theor. Comput. Sci. 134 (2) (1994)
Michael Kaminski
Interpretations of Open Default Theories in Non-Monotonic Logics. Ann. Math. Artif. Intell. 9 (3-4) (1993)
Michael Kaminski, Shlomit S. Pinter
Finite Automata on Directed Graphs. J. Comput. Syst. Sci. 44 (3) (1992)
Amir Averbuch, Nader H. Bshouty, Michael Kaminski
A Classification of Algorithms for Multiplying Polynomials of Small Degree over Finite Fields. J. Algorithms 13 (4) (1992)
Michael L. Tiomkin, Michael Kaminski
Nonmonotonic Default Modal Logics. J. ACM 38 (4) (1991)
Michael Kaminski
Embedding a default system into nonmonotonic logics. Fundam. Informaticae 14 (3) (1991)
Michael Kaminski, Michael L. Tiomkin
Finite and Circular Path Models for Branching Time Logics. J. Log. Comput. 1 (1) (1990)
Nader H. Bshouty, Michael Kaminski
Multiplication of Polynomials over Finite Fields. SIAM J. Comput. 19 (3) (1990)
Michael Kaminski, Nissim Francez
Finite-Memory Automata (Extended Abstract) FOCS (1990)
Michael L. Tiomkin, Michael Kaminski
Nonmonotonic Default Modal Logics. TARK (1990)
Michael Kaminski, Nader H. Bshouty
Multiplicative complexity of polynomial multiplication over finite fields. J. ACM 36 (1) (1989)
Michael Kaminski
A note on probabilistically verifying integer and polynomial products. J. ACM 36 (1) (1989)
Michael Kaminski
Nonstandard connectives of intuitionistic propositional logic. Notre Dame J. Formal Log. 29 (3) (1988)
Michael Kaminski, David G. Kirkpatrick, Nader H. Bshouty
Addition Requirements for Matrix and Transposed Matrix Products. J. Algorithms 9 (3) (1988)
Michael Kaminski
An Algorithm for Polynomial Multiplication that Does Not Depend on the Ring Constants. J. Algorithms 9 (1) (1988)
Michael Kaminski, Nader H. Bshouty
Multiplicative complexity of polynomial multiplication over finite fields (Extended abstract) FOCS (1987)
Michael Kaminski
A linear time algorithm for residue computation and a fast algorithm for division with a sparse divisor. J. ACM 34 (4) (1987)
Michael Kaminski
A Classification of omega-Regular Languages. Theor. Comput. Sci. 36 (1985)
Michael Kaminski
A Lower Bound for Polynomial Multiplication. Theor. Comput. Sci. 40 (1985)
Michael Kaminski
Mulltiplication of Polynomials over the Ring of Integers FOCS (1984)
Michael Kaminski
Note on probabilistic algorithms in integer and polynomial arithmetic. SYMSACC (1981)