Giora Slutzki

According to our database, Giora Slutzki authored at least 66 papers between 1973 and 2021.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2021

Secrecy-preserving Reasoning in Acyclic DL-LiteR Knowledge Bases in the Presence of BCQs.

Gopalakrishnan Krishnaswamy Sivaprakasam, Giora Slutzki

Proceedings of the 13th International Conference on Agents and Artificial Intelligence, 2021

2020

Nonregularity via Ordinal Extensions.

Jack H. Lutz, Giora Slutzki

CoRR, 2020

Secrecy-preserving Reasoning in ELH Knowledge Bases using MapReduce Algorithm.

Gopalakrishnan Krishnasamy Sivaprakasam, Giora Slutzki

Proceedings of the 12th International Conference on Agents and Artificial Intelligence, 2020

2017

Keeping Secrets in Modalized DL Knowledge Bases.

Gopalakrishnan Krishnaswamy Sivaprakasam, Giora Slutzki

Proceedings of the 9th International Conference on Agents and Artificial Intelligence, 2017

Secrecy-Preserving Reasoning and Query Answering in Probabilistic Description Logic Knowledge Bases.

Gopalakrishnan Krishnasamy Sivaprakasam, Adrienne Raglin, Douglas Summers-Stay, Giora Slutzki

Proceedings of the GCAI 2017, 2017

2016

Keeping Secrets in <i>EL</i>^+ Knowledge Bases.

Gopalakrishnan Krishnaswamy Sivaprakasam, Giora Slutzki

Proceedings of the Agents and Artificial Intelligence - 8th International Conference, 2016

Secrecy-Preserving Query Answering in ELH Knowledge Bases.

Gopalakrishnan Krishnaswamy Sivaprakasam, Giora Slutzki

Proceedings of the 8th International Conference on Agents and Artificial Intelligence (ICAART 2016), 2016

2015

A Knowledge Based Framework for Case-specific Diagnosis.

Ganesh Ram Santhanam, Gopalakrishnan Sivaprakasam, Giora Slutzki, Samik Basu

Proceedings of the ICAART 2015, 2015

2014

A Conceptual Framework for Secrecy-preserving Reasoning in Knowledge Bases.

Jia Tao, Giora Slutzki, Vasant G. Honavar

ACM Trans. Comput. Log., 2014

2012

PSPACE Tableau Algorithms for Acyclic Modalized $\boldsymbol{\mathcal{ALC}}$.

Jia Tao, Giora Slutzki, Vasant G. Honavar

J. Autom. Reason., 2012

2010

Secrecy-Preserving Query Answering for Instance Checking in <i>EL</i>\mathcal{EL}.

Jia Tao, Giora Slutzki, Vasant G. Honavar

Proceedings of the Web Reasoning and Rule Systems - Fourth International Conference, 2010

2009

Package-Based Description Logics.

Jie Bao, George Voutsadakis, Giora Slutzki, Vasant G. Honavar

Proceedings of the Modular Ontologies: Concepts, 2009

Clearing a Polygon with Two 1-Searchers.

Borislav H. Simov, Giora Slutzki, Steven M. LaValle

Int. J. Comput. Geom. Appl., 2009

2008

Federated ALCI: Preliminary Report.

George Voutsadakis, Giora Slutzki, Vasant G. Honavar, Jie Bao

Proceedings of the 2008 IEEE / WIC / ACM International Conference on Web Intelligence, 2008

On the Decidability of Role Mappings between Modular Ontologies.

Jie Bao, George Voutsadakis, Giora Slutzki, Vasant G. Honavar

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007

Privacy-Preserving Reasoning on the SemanticWeb.

Jie Bao, Giora Slutzki, Vasant G. Honavar

Proceedings of the 2007 IEEE / WIC / ACM International Conference on Web Intelligence, 2007

Incentive-Driven P2P Anonymity System: A Game-Theoretic Approach.

Souvik Ray, Giora Slutzki, Zhao Zhang

Proceedings of the 2007 International Conference on Parallel Processing (ICPP 2007), 2007

A Semantic Importing Approach to Knowledge Reuse from Multiple Ontologies.

Jie Bao, Giora Slutzki, Vasant G. Honavar

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006

Scoring of web pages and tournaments - axiomatizations.

Giora Slutzki, Oscar Volij

Soc. Choice Welf., 2006

2005

Ranking participants in generalized tournaments.

Giora Slutzki, Oscar Volij

Int. J. Game Theory, 2005

2004

Parametric multiple sequence alignment and phylogeny construction.

David Fernández-Baca, Timo Seppäläinen, Giora Slutzki

J. Discrete Algorithms, 2004

2002

Computational complexity of some problems involving congruences on algebras.

Clifford Bergman, Giora Slutzki

Theor. Comput. Sci., 2002

An Algorithm for Searching a Polygonal Region with a Flashlight.

Steven M. LaValle, Borislav H. Simov, Giora Slutzki

Int. J. Comput. Geom. Appl., 2002

Computational Complexity of Generators and Nongenerators in Algebra.

Clifford Bergman, Giora Slutzki

Int. J. Algebra Comput., 2002

Bounds for parametric sequence comparison.

David Fernández-Baca, Timo Seppäläinen, Giora Slutzki

Discret. Appl. Math., 2002

A Complete Pursuit-Evasion Algorithm for Two Pursuers using Beam Detection.

Borislav H. Simov, Steven M. LaValle, Giora Slutzki

Proceedings of the 2002 IEEE International Conference on Robotics and Automation, 2002

2000

Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras.

Clifford Bergman, Giora Slutzki

SIAM J. Comput., 2000

Pursuit-Evasion Using Beam Detection.

Borislav H. Simov, Giora Slutzki, Steven M. LaValle

Proceedings of the 2000 IEEE International Conference on Robotics and Automation, 2000

1999

Computational Complexity of Term-Equivalence.

Clifford Bergman, David Juedes, Giora Slutzki

Int. J. Algebra Comput., 1999

Complexity of Some Problems in Universal Algebra.

Clifford Bergman, Giora Slutzki

Proceedings of the STACS 99, 1999

1997

Multi-Valued Logic Programming Semantics: An Algebraic Approach.

Bamshad Mobasher, Don Pigozzi, Giora Slutzki

Theor. Comput. Sci., 1997

Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs.

David Fernández-Baca, Giora Slutzki

Theor. Comput. Sci., 1997

Optimal Parametric Search on Graphs of Bounded Tree-Width.

David Fernández-Baca, Giora Slutzki

J. Algorithms, 1997

1996

Using Sparsification for Parametric Minimum Spanning Tree Problems.

David Fernández-Baca, Giora Slutzki, David Eppstein

Nord. J. Comput., 1996

A Hierarchy of Deterministic Top-Down Tree Transformations.

Giora Slutzki, Sándor Vágvölgyi

Math. Syst. Theory, 1996

Distributing Tokens on a Hypercube without Error Accumulation.

Bogdan S. Chlebus, José D. P. Rolim, Giora Slutzki

Proceedings of IPPS '96, 1996

1995

Deterministic Top-Down Tree Transducers with Iterated Lookahead.

Giora Slutzki, Sándor Vágvölgyi

Theor. Comput. Sci., 1995

Fast Algorithms for Inferring Evolutionary Trees.

Richa Agarwala, David Fernández-Baca, Giora Slutzki

J. Comput. Biol., 1995

A Scheme to Construct Distance Three Codes Using Latin Squares, with Applications to the n-Cube.

Pranava K. Jha, Giora Slutzki

Inf. Process. Lett., 1995

1994

The Complexity of Optimizing Finite-State Transducers.

Craig A. Rich, Giora Slutzki

Theor. Comput. Sci., 1994

Parametric Problems on Graphs of Bounded Tree-Width.

David Fernández-Baca, Giora Slutzki

J. Algorithms, 1994

A Note on the Equivalence of a Set of Egds to a Set of FDs.

John H. Leuchner, Les Miller, Giora Slutzki

Inf. Process. Lett., 1994

1991

Agreement Graph Dependencies.

John H. Leuchner, Les Miller, Giora Slutzki

Bull. EATCS, 1991

1990

The complexity of a counting finite-state automation.

Craig A. Rich, Giora Slutzki

Acta Cybern., 1990

1989

Comparisons Between Some Pumping Conditions for Context-Free Languages.

Rattikorn Hewett, Giora Slutzki

Math. Syst. Theory, 1989

Solving Parametric Problems on Trees.

David Fernández-Baca, Giora Slutzki

J. Algorithms, 1989

1988

The Interchange or Pump (Di)Lemmas for Context-Free Languages.

R. Boonyavatana, Giora Slutzki

Theor. Comput. Sci., 1988

A Polynomial Time Algorithm for Testing Implications of a Join Dependency and Embodied Functional Dependencies.

John H. Leuchner, Les Miller, Giora Slutzki

Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data, 1988

1987

Note: on the sufficiency of Igarashi's conditions for real-time deterministic context-free-languages.

R. Boonyavatana, Giora Slutzki

Bull. EATCS, 1987

1986

Ogden's Lemma for Monterminal Bounded Languages.

R. Boonyavatana, Giora Slutzki

RAIRO Theor. Informatics Appl., 1986

A generalized Ogden's lema for linear conteext-free languages.

R. Boonyavatana, Giora Slutzki

Bull. EATCS, 1986

1985

Alternating Tree Automata.

Giora Slutzki

Theor. Comput. Sci., 1985

1984

Extended Macro Grammars and Stack Controlled Machines.

Joost Engelfriet, Giora Slutzki

J. Comput. Syst. Sci., 1984

1982

Transductions of Dags and Trees.

Tsutomu Kamimura, Giora Slutzki

Math. Syst. Theory, 1982

Finite State Relational Programs.

Giora Slutzki

Acta Informatica, 1982

1981

Parallel and Two-Way Automata on Directed Ordered Acyclic Graphs

Tsutomu Kamimura, Giora Slutzki

Inf. Control., April, 1981

Automatic Programming of Finite State Linear Programs.

Amir Pnueli, Giora Slutzki

SIAM J. Comput., 1981

1980

Tree Transducers, L Systems, and Two-Way Machines.

Joost Engelfriet, Grzegorz Rozenberg, Giora Slutzki

J. Comput. Syst. Sci., 1980

Descriptional Complexity of Concurrent Processes (preliminary version).

Giora Slutzki

Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

1979

Bounded Nesting in Macro Grammars

Joost Engelfriet, Giora Slutzki

Inf. Control., August, 1979

Parallel and Two-Way Recognizers of Directed Acyclic Graphs (Extended Abstract).

Tsutomu Kamimura, Giora Slutzki

Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

DAGs and Chomsky Hierarchy (Extended Abstract).

Tsutomu Kamimura, Giora Slutzki

Proceedings of the Automata, 1979

1978

Tree Transducers, L Systems and Two-Way Machines (Extended Abstract)

Joost Engelfriet, Grzegorz Rozenberg, Giora Slutzki

Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978

1977

Simple Programs and Their Decision Problems.

Amir Pnueli, Giora Slutzki

Proceedings of the Automata, 1977

1976

Logical analysis of simple programs

Giora Slutzki

PhD thesis, 1976

1973

On the Non-Compactness of the Class of Program Schemas.

Nissim Francez, Giora Slutzki

Inf. Process. Lett., 1973