Titlebook: Web Reasoning and Rule Systems; 5th International Co Sebastian Rudolph,Claudio Gutierrez Conference proceedings 2011 Springer-Verlag GmbH B

Acetaminophen

Bernstein-test

CURL

Reasoning as Axioms Change,soners have to address the problem of changing axioms in the presence of materializations of derived atoms. Existing approaches have drawbacks: some require to generate and evaluate large transformed programs that are in Datalog. while the source program is in Datalog and significantly smaller; some

oxidize

Decidability of Unification in EL without Top Constructor, in natural language processing, configuration of technical systems, databases and biomedical ontologies. Unification is used there as a tool to recognize equivalent concepts. It has been proven that unification in . is NP-complete. This result was based on a locality property of certain . unifiers.

退潮

Query Rewriting for Inconsistent DL-Lite Ontologies, of inconsistency-tolerant semantics and show that for some of such variants answering unions of conjunctive queries (UCQs) is first-order (FOL) rewritable, i.e., it can be reduced to standard evaluation of a FOL/SQL query over a database. Since FOL-rewritability of query answering for UCQs over con

squander

On the Equivalence between the , Action Language and Partial Actions in Transaction Logic,ication of state-changing transactions. The action language . is a well-known formalism to describe changing domains and for reasoning about actions. The purpose of this paper is to compare these two formalisms and identify their similarities and points of divergence in order to better understand th

聰明

Reasoning with Actions in Transaction Logic,, but extends it with special .-formulas that generalize the data and transition formulas of the original Transaction Logic. We develop a sound and complete proof theory for .. and illustrate the formalism on a number of non-trivial examples. In addition, we show that most of .. is reducible to ordi

overture

線

去掉