Parameterized Complexity and Fixed-Parameter Tractability of Description Logic Reasoning.

Parameterized Complexity and Fixed-Parameter Tractability of Description Logic Reasoning.

An important goal of research in description logics (DLs) and related logic-based KR formalisms is to identify the worst-case complexity of reasoning. Such results, however, measure the complexity of a logic as a whole. For example, reasoning in the basic DL is ExpTime-complete, which means that con...

Bibliografske podrobnosti
Glavni avtor:	Motik, B
Drugi avtorji:	Bjørner, N
Format:	Journal article
Jezik:	English
Izdano:	Springer 2012

Podobne knjige/članki

Consequence-based and fixed-parameter tractable reasoning in description logics
od: Simancik, F, et al.
Izdano: (2014)

Fixed Parameter Tractable Reasoning in DLs via Decomposition.
od: Simancik, F, et al.
Izdano: (2011)

Tractable reasoning with bayesian description logics
od: D'Amato, C, et al.
Izdano: (2008)

Tractable Reasoning with Bayesian Description Logics
od: d'Amato, C, et al.
Izdano: (2008)

Tractable query answering and rewriting under description logic constraints.
od: Pérez-Urbina, H, et al.
Izdano: (2010)

Tractable Query Answering and Rewriting under Description Logic Constraints
od: Pérez−Urbina, H, et al.
Izdano: (2009)

Tractable Reasoning in a Fragment of Separation Logic.
od: Cook, B, et al.
Izdano: (2011)

Tractable reasoning in a fragment of separation logic
od: Cook, B, et al.
Izdano: (2011)

Tractable Probabilistic Description Logic Programs
od: Lukasiewicz, T
Izdano: (2007)

Tractable Probabilistic Description Logic Programs
od: Lukasiewicz, T, et al.
Izdano: (2013)

Hypertableau Reasoning for Description Logics
od: Motik, B, et al.
Izdano: (2014)

Individual Reuse in Description Logic Reasoning.
od: Motik, B, et al.
Izdano: (2008)

Optimized Reasoning in Description Logics Using Hypertableaux.
od: Motik, B, et al.
Izdano: (2007)

Minimizing Movement: Fixed-Parameter Tractability
od: Demaine, Erik D, et al.
Izdano: (2022)

Minimizing Movement: Fixed-Parameter Tractability
od: Demaine, Erik D, et al.
Izdano: (2021)

Minimizing movement: Fixed-parameter tractability
od: Demaine, Erik D., et al.
Izdano: (2011)

Tractable Extensions of the Description Logic EL with Numerical Datatypes
od: Magka, D, et al.
Izdano: (2011)

Tractable Extensions of the Description Logic EL with Numerical Datatypes
od: Magka, D, et al.
Izdano: (2015)

Tractable Extensions of the Description Logic EL with Numerical Datatypes
od: Magka, D, et al.
Izdano: (2010)

Tractable Extensions of the Description Logic EL with Numerical Datatypes
od: Magka, D, et al.
Izdano: (2010)

Tractable Extensions of the Description Logic EL with Numerical Datatypes
od: Magka, D, et al.
Izdano: (2010)

Tractable Extensions of the Description Logic EL with Numerical Datatypes
od: Kazakov, D, et al.
Izdano: (2011)

Tractable Extensions of the Description Logic EL with Numerical Datatypes
od: Magka, D, et al.
Izdano: (2010)

Tractable Extensions of the Description Logic EL with Numerical Datatypes.
od: Magka, D, et al.
Izdano: (2011)

Optimized Description Logic Reasoning via Core Blocking.
od: Glimm, B, et al.
Izdano: (2010)

Optimized Description Logic Reasoning via Core Blocking
od: Glimm, B, et al.
Izdano: (2010)

Reasoning in Description Logics by a Reduction to Disjunctive Datalog.
od: Hustadt, U, et al.
Izdano: (2007)

A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes.
od: Motik, B, et al.
Izdano: (2006)

Tractable query answering for description logics via query rewriting
od: Perez-Urbina, H, et al.
Izdano: (2010)

Consequence-based reasoning for description logics with disjunctions and number restrictions
od: Bate, A, et al.
Izdano: (2018)

Consequence-based reasoning for description logics with disjunctions and number restrictions
od: Bate, A, et al.
Izdano: (2018)

Semantic width and the fixed-parameter tractability of constraint satisfaction problems
od: Chen, H, et al.
Izdano: (2020)

Combining Description Logics, Description Graphs, and Rules.
od: Motik, B
Izdano: (2010)

Pushing the boundaries of tractable ontology reasoning
od: Carral, D, et al.
Izdano: (2014)

Tractable probabilistic models for causal learning and reasoning
od: Wang, B
Izdano: (2023)

A Tractable Logic for Molecular Biology
od: Adrien Husson, et al.
Izdano: (2019-09-01)

Default Reasoning from Conditional Knowledge Bases: Complexity and Tractable Cases
od: Eiter, T, et al.
Izdano: (2000)

Fixed-parameter tractable sampling for RNA design with multiple target structures
od: Stefan Hammer, et al.
Izdano: (2019-04-01)

Reconciling description logics and rules.
od: Motik, B, et al.
Izdano: (2010)

On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases
od: Baumgartner, R, et al.
Izdano: (1999)