Sciweavers

110 search results - page 22 / 22
» A Tutorial on Proof Theoretic Foundations of Logic Programmi...
Sort
View
ICALP
2009
Springer
14 years 6 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
FOCS
1998
IEEE
13 years 10 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
AIML
1998
13 years 7 months ago
Propositions, Propositional Attitudes and Belief Revision
In this paper I will propose a new approach to certain semantic puzzles due to Frege, Kripke and others, and the question of propositional attitudes, via the notion of belief revi...
Rohit Parikh
ICDE
2004
IEEE
179views Database» more  ICDE 2004»
14 years 7 months ago
CrossMine: Efficient Classification Across Multiple Database Relations
Most of today's structured data is stored in relational databases. Such a database consists of multiple relations which are linked together conceptually via entity-relationsh...
Xiaoxin Yin, Jiawei Han, Jiong Yang, Philip S. Yu
BIOCOMP
2007
13 years 7 months ago
Stability Analysis of Genetic Regulatory Network with Additive Noises
Background: Genetic regulatory networks (GRN) can be described by differential equations with SUM logic which has been found in many natural systems. Identification of the network...
Yufang Jin