Michael Kaminski

Arch. Math. Log., November, 2024

Many-Valued Modal Logic.

[BibT_eX]

[DOI]

Amir Karniel

Proceedings of the Proceedings Eleventh International Conference on Non-Classical Logics. Theory and Applications, January, 2024

2023

On sets of linear forms of maximal complexity.

[BibT_eX]

[DOI]

Igor E. Shparlinski

Michel Waldschmidt

Comput. Complex., 2023

2022

Extending the Lambek Calculus with Classical Negation.

[BibT_eX]

[DOI]

Stud Logica, 2022

A Note on Calculi for Non-deterministic Many-valued Logics.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2022

2021

Calculi for Many-Valued Logics.

[BibT_eX]

[DOI]

Logica Universalis, 2021

Sets of Linear Forms Which Are Hard to Compute.

[BibT_eX]

[DOI]

Igor E. Shparlinski

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020

De Morgan Interpretation of the Lambek-Grishin Calculus.

[BibT_eX]

[DOI]

Rev. Symb. Log., 2020

2019

Structural Rules for Multi-valued Logics.

[BibT_eX]

[DOI]

Logica Universalis, 2019

On Poly-logistic Natural-deduction for Finitely-valued Propositional Logics.

[BibT_eX]

[DOI]

FLAP, 2019

2018

Closure Under Reversal of Languages over Infinite Alphabets.

[BibT_eX]

[DOI]

Daniel Genkin

Liat Peterfreund

Proceedings of the Computer Science - Theory and Applications, 2018

2017

A Proof-Theoretic Semantics for Exclusion.

[BibT_eX]

[DOI]

Logica Universalis, 2017

2016

The Lambek Calculus Extended with Intuitionistic Propositional Logic.

[BibT_eX]

[DOI]

Stud Logica, 2016

LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2016

2014

A note on the emptiness problem for alternating finite-memory automata.

[BibT_eX]

[DOI]

Daniel Genkin

Liat Peterfreund

Theor. Comput. Sci., 2014

Relational Semantics of the Lambek Calculus Extended with Classical Propositional Logic.

[BibT_eX]

[DOI]

Stud Logica, 2014

2013

An Upper Bound on the Complexity of Multiplication of Polynomials Modulo a Power of an Irreducible Polynomial.

[BibT_eX]

[DOI]

Chaoping Xing

IEEE Trans. Inf. Theory, 2013

2011

<i>LR</i>(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2011

2010

CSL 2008 special issue.

[BibT_eX]

[DOI]

Simone Martini

ACM Trans. Comput. Log., 2010

Extending Free Pregroups with Lower Bounds.

[BibT_eX]

[DOI]

Stud Logica, 2010

Finite-Memory Automata with Non-Deterministic Reassignment.

[BibT_eX]

[DOI]

Daniel Zeitlin

Int. J. Found. Comput. Sci., 2010

A Note on Two-pebble Automata Over Infinite Alphabets.

[BibT_eX]

[DOI]

Tony Tan

Fundam. Informaticae, 2010

Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars.

[BibT_eX]

[DOI]

Daniel Genkin

Proceedings of the Time for Verification, 2010

2009

Linear Conjunctive Grammars and One-Turn Synchronized Alternating Pushdown Automata.

[BibT_eX]

[DOI]

Proceedings of the Formal Grammar - 14th International Conference, 2009

The Power of Non-deterministic Reassignment in Infinite-Alphabet Pushdown Automata.

[BibT_eX]

[DOI]

Yulia Dubov

Proceedings of the Languages: From Formal to Natural, 2009

2008

Notions of Sameness by Default and their Application to Anaphora, Vagueness, and Uncertain Reasoning.

[BibT_eX]

[DOI]

Ariel Cohen

Johann A. Makowsky

J. Log. Lang. Inf., 2008

Commutation-augmented pregroup grammars and push-down automata with cancellation.

[BibT_eX]

[DOI]

Inf. Comput., 2008

Invariance Under Stuttering in a Temporal Logic without the "Until" Operator.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2008

First-Order Ground Non-Monotonic Modal Logic.

[BibT_eX]

[DOI]

Benjamin Grimberg

Fundam. Informaticae, 2008

Preface.

[BibT_eX]

[DOI]

Miroslaw Truszczynski

Ann. Math. Artif. Intell., 2008

Conjunctive Grammars and Alternating Pushdown Automata.

[BibT_eX]

[DOI]

Proceedings of the Logic, 2008

A Non-Preferential Semantics of Non-Monotonic Modal Logic.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

Tree Automata over Infinite Alphabets.

[BibT_eX]

[DOI]

Tony Tan

Proceedings of the Pillars of Computer Science, 2008

Extending finite-memory automata with non-deterministic reassignment (Extended abstract).

[BibT_eX]

Daniel Zeitlin

Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

2007

Commutation-Augmented Pregroup Grammars and Mildly Context-Sensitive Languages.

[BibT_eX]

[DOI]

Stud Logica, 2007

The Modal Logic of Cluster-Decomposable Kripke Interpretations.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 2007

Pushdown automata with cancellation and commutation-augmented pregroups grammars.

[BibT_eX]

Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

2006

Default theories over monadic languages.

[BibT_eX]

[DOI]

Julia Rubin-Mosin

Theor. Comput. Sci., 2006

Invariance under stuttering in a temporal logic of actions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Polynomial multiplication over finite fields: from quadratic to straight-line complexity.

[BibT_eX]

[DOI]

Comput. Complex., 2006

Preface.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2006

Complexity of Polynomial Multiplication over Finite Fields.

[BibT_eX]

[DOI]

Proceedings of the Computer Science, 2006

2005

A Lower Bound on the Complexity of Polynomial Multiplication Over Finite Fields.

[BibT_eX]

[DOI]

Proceedings of the STACS 2005, 2005

Indistinguishability by Default.

[BibT_eX]

Ariel Cohen

Johann A. Makowsky

Proceedings of the We Will Show Them! Essays in Honour of Dov Gabbay, Volume One, 2005

2004

Default Theories Over Monadic Languages: (Extended Abstract).

[BibT_eX]

[DOI]

Julia Mosin

Proceedings of the 11th Workshop on Logic, Language, Information and Computation, 2004

Regular Expressions for Languages over Infinite Alphabets.

[BibT_eX]

[DOI]

Tony Tan

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003

An algebraic characterization of deterministic regular languages over infinite alphabets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

A Real-time Semantics of Temporal Logic of Actions.

[BibT_eX]

[DOI]

Yael Yariv

J. Log. Comput., 2003

2002

Revisiting quantification in autoepistemic logic.

[BibT_eX]

[DOI]

Guy Rey

ACM Trans. Comput. Log., 2002

The Expressive Power of Temporal Logic of Actions.

[BibT_eX]

[DOI]

Arkadi Estrin

J. Log. Comput., 2002

2000

First-order Non-monotonic Modal Logics.

[BibT_eX]

[DOI]

Rachel Ben-Eliyahu-Zohary

Guy Rey

Fundam. Informaticae, 2000

1999

Similarity Preservation in Default Logic.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 1999

Open Default Theories over Closed Domains.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Quantitative Approaches to Reasoning and Uncertainty, 1999

The Expressive Power of Temporal Logic of Actions (Extended Abstract).

[BibT_eX]

[DOI]

Arkadi Estrin

Proceedings of the CONCUR '99: Concurrency Theory, 1999

1998

Minimum Dominating Sets of Intervals on Lines.

[BibT_eX]

[DOI]

Siu-Wing Cheng

Shmuel Zaks

Algorithmica, 1998

Context-Free Languages over Infinite Alphabets.

[BibT_eX]

[DOI]

Edward Y. C. Cheng

Acta Informatica, 1998

1997

The elimination of de re formulas.

[BibT_eX]

[DOI]

J. Philos. Log., 1997

A Note on the Stable Model Semantics for Logic Programs. (Research Note).

[BibT_eX]

[DOI]

Artif. Intell., 1997

1996

The Power of the "Always" Operator in First-Order Temporal Logic.

[BibT_eX]

[DOI]

Chung Kei Wong

Theor. Comput. Sci., 1996

The Expressive Power of Second-Order Propositional Modal Logic.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 1996

Extensions for Open Default Theories via the Domain Closure Assumption.

[BibT_eX]

[DOI]

Johann A. Makowsky

Proceedings of the Logics in Artificial Intelligence, European Workshop, 1996

1995

Semantical Analysis of Logic of Actions.

[BibT_eX]

[DOI]

J. Log. Comput., 1995

A Comparative Study of Open Default Theories.

[BibT_eX]

[DOI]

Artif. Intell., 1995

Minimum Dominating Sets of Intervals on Lines (Extended Abstract).

[BibT_eX]

[DOI]

Siu-Wing Cheng

Shmuel Zaks

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

Finite-Memory Automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

A Branching Time Logic with Past Operators.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1994

1993

Interpretations of Open Default Theories in Non-Monotonic Logics.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 1993

1992

Finite Automata on Directed Graphs.

[BibT_eX]

[DOI]

Shlomit S. Pinter

J. Comput. Syst. Sci., 1992

A Classification of Algorithms for Multiplying Polynomials of Small Degree over Finite Fields.

[BibT_eX]

[DOI]

Amir Averbuch

J. Algorithms, 1992

1991

Embedding a default system into nonmonotonic logics.

[BibT_eX]

Fundam. Informaticae, 1991

1990

Multiplication of Polynomials over Finite Fields.

[BibT_eX]

[DOI]

SIAM J. Comput., 1990

Finite and Circular Path Models for Branching Time Logics.

[BibT_eX]

[DOI]

J. Log. Comput., 1990

Nonmonotonic Default Modal Logics.

[BibT_eX]

Proceedings of the 3rd Conference on Theoretical Aspects of Reasoning about Knowledge, 1990

Finite-Memory Automata (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989

Multiplicative complexity of polynomial multiplication over finite fields.

[BibT_eX]

[DOI]

J. ACM, 1989

A note on probabilistically verifying integer and polynomial products.

[BibT_eX]

[DOI]

J. ACM, 1989

1988

Nonstandard connectives of intuitionistic propositional logic.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 1988

Addition Requirements for Matrix and Transposed Matrix Products.

[BibT_eX]

[DOI]

David G. Kirkpatrick

J. Algorithms, 1988

An Algorithm for Polynomial Multiplication that Does Not Depend on the Ring Constants.

[BibT_eX]

[DOI]

J. Algorithms, 1988

1987

A linear time algorithm for residue computation and a fast algorithm for division with a sparse divisor.

[BibT_eX]

[DOI]

J. ACM, 1987

Multiplicative complexity of polynomial multiplication over finite fields (Extended abstract)

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1985

A Lower Bound for Polynomial Multiplication.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

A Classification of omega-Regular Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

1984

Mulltiplication of Polynomials over the Ring of Integers

[BibT_eX]

[DOI]

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1982

אלגוריתמים לכפל פולינומים ומספרים שלמים (Algorithms for polynomial and integer multiplication.).

[BibT_eX]

[DOI]

PhD thesis, 1982

1981

Note on probabilistic algorithms in integer and polynomial arithmetic.

[BibT_eX]

[DOI]