Sciweavers

417 search results - page 53 / 84
» Results on Reasoning about Updates in Transaction Logic
Sort
View
LICS
2010
IEEE
15 years 4 months ago
Addition-Invariant FO and Regularity
We consider formulas which, in addition to the symbols in the vocabulary, may use two designated symbols ≺ and + that must be interpreted as a linear order and its associated ad...
Nicole Schweikardt, Luc Segoufin
LOPSTR
2005
Springer
15 years 11 months ago
Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates
Partial evaluation of logic programs which contain impure predicates poses non-trivial challenges. Impure predicates include those which produce side-effects, raise errors (or exc...
Elvira Albert, Germán Puebla, John P. Galla...
ILP
2004
Springer
15 years 11 months ago
Modelling Inhibition in Metabolic Pathways Through Abduction and Induction
Abstract. In this paper, we study how a logical form of scientific modelling that integrates together abduction and induction can be used to understand the functional class of unk...
Alireza Tamaddoni-Nezhad, Antonis C. Kakas, Stephe...
DBPL
1995
Springer
106views Database» more  DBPL 1995»
15 years 9 months ago
On Impossibility of Decremental Recomputation of Recursive Queries in Relational Calculus and SQL
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
Guozhu Dong, Leonid Libkin, Limsoon Wong
DLOG
2008
15 years 8 months ago
SRIQ and SROIQ are Harder than SHOIQ
We identify the complexity of (finite model) reasoning in the DL SROIQ to be N2ExpTime-complete. We also prove that (finite model) reasoning in the DL SR--a fragment of SROIQ witho...
Yevgeny Kazakov