LICS 2010 - PDF Preprint Papers

LICS 2010 Symposium on Logic in Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed LICS-2010 Paper

click to vote

LICS
2010
IEEE

266views Automated Reasoning» more LICS 2010»

Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications

13 years 10 months ago

Download www.lirmm.fr

Abstract--This paper summarizes results on a recently introduced family of Datalog-based languages, called Datalog+/-, which is a new framework for tractable ontology querying, and...

Andrea Calì, Georg Gottlob, Thomas Lukasiew...

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	266	Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications	claim
2	193	Abstracting the Differential Semantics of Rule-Based Models: Exact and Automated Model Reduction	claim
3	191	The Emptiness Problem for Tree Automata with Global Constraints	claim
4	184	Breaking Paths in Atomic Flows for Classical Logic	claim
5	176	Addition-Invariant FO and Regularity	claim
6	174	The Isomorphism Problem on Classes of Automatic Structures	claim
7	170	Alternating Timed Automata over Bounded Time	claim
8	167	The Expressive Power of Synchronizations	claim
9	162	Regular Cost Functions over Finite Trees	claim
10	160	On the Strictness of the First-Order Quantifier Structure Hierarchy over Finite Structures	claim
11	159	A Generic Operational Metatheory for Algebraic Effects	claim
12	157	On the Expressivity of Symmetry in Event Structures	claim
13	151	Polarity and the Logic of Delimited Continuations	claim
14	148	On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction	claim
15	146	Recursion Schemes and Logical Reflection	claim
16	143	An Extension of Data Automata that Captures XPath	claim
17	142	On Strong Maximality of Paraconsistent Finite-Valued Logics	claim
18	141	Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors	claim
19	138	Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment	claim
20	138	A Sound and Complete Calculus for Finite Stream Circuits	claim
21	136	Weak Equivalences in Psi-Calculi	claim
22	134	Equality Is Typable in Semi-full Pure Type Systems	claim
23	133	Segal Condition Meets Computational Effects	claim
24	132	An Intuitionistic Logic that Proves Markov's Principle	claim
25	131	Undecidability of Propositional Separation Logic and Its Neighbours	claim
26	131	Querying the Guarded Fragment	claim
27	130	The Undecidability of Boolean BI through Phase Semantics	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers