Sciweavers

Share
87 search results - page 2 / 18
» On Reachability of Minimal Models of Multilattice-Based Logi...
Sort
View
LICS
2009
IEEE
10 years 9 months ago
Pointer Programs and Undirected Reachability
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
Martin Hofmann, Ulrich Schöpp
COCOON
2003
Springer
10 years 8 months ago
Petri Nets with Simple Circuits
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...
Hsu-Chun Yen, Lien-Po Yu
IJCAI
2003
10 years 4 months ago
Logic Programs for Consistently Querying Data Integration Systems
We solve the problem of obtaining answers to queries posed to a mediated integration system unĀ­ der the local-as-view paradigm that are consistent wrt to certain global integrity...
Loreto Bravo, Leopoldo E. Bertossi
AAAI
2008
10 years 3 months ago
Querying Sequential and Concurrent Horn Transaction Logic Programs Using Tabling Techniques
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
Paul Fodor
AMW
2010
10 years 4 months ago
Logic Programs for Repairing Inconsistent Dimensions in Data Warehouses
A Data Warehouse (DW) is a data repository that integrates data from multiple sources and organizes the data according to a set of data structures called dimensions. Each dimension...
Loreto Bravo, Mónica Caniupán Marile...
books