Michael Kaminski

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