LPAR 2007 - PDF Preprint Papers

LPAR 2007 Logic for Programming

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed LPAR-2007 Paper

click to vote

LPAR
2007
Springer

196views Automated Reasoning» more LPAR 2007»

Data Complexity in the EL Family of Description Logics

14 years 5 months ago

Download www.informatik.uni-bremen.de

We study the data complexity of instance checking and conjunctive query answering in the EL family of description logics, with a particular emphasis on the boundary of tractability...

Adila Krisnadhi, Carsten Lutz

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	196	Data Complexity in the EL Family of Description Logics	claim
2	184	Completeness and Decidability in Sequence Logic	claim
3	165	Preferential Description Logics	claim
4	160	The Complexity of Temporal Logic with Until and Since over Ordinals	claim
5	153	Complexity of Planning in Action Formalisms Based on Description Logics	claim
6	147	Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap	claim
7	135	Extending a Resolution Prover for Inequalities on Elementary Functions	claim
8	131	Completeness for Flat Modal Fixpoint Logics	claim
9	129	How Many Legs Do I Have? Non-Simple Roles in Number Restrictions Revisited	claim
10	124	Deciding Knowledge in Security Protocols for Monoidal Equational Theories	claim
11	122	Permutative Additives and Exponentials	claim
12	119	On Two Extensions of Abstract Categorial Grammars	claim
13	117	Algorithms for Propositional Model Counting	claim
14	116	Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic	claim
15	114	Zenon : An Extensible Automated Theorem Prover Producing Checkable Proofs	claim
16	114	One-Pass Tableaux for Computation Tree Logic	claim
17	112	From Hilbert's Program to a Logic Toolbox	claim
18	111	Whatever Happened to Deductive Question Answering?	claim
19	109	Decidable Fragments of Many-Sorted Logic	claim
20	95	An Extension of the Knuth-Bendix Ordering with LPO-Like Properties	claim
21	94	HORPO with Computability Closure: A Reconstruction	claim
22	91	Verifying Cryptographic Protocols with Subterms Constraints	claim
23	77	Why Would You Trust B ?	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers