Sciweavers

5084 search results - page 229 / 1017
» Proving Possibility Properties
Sort
View
EDBT
2008
ACM
108views Database» more  EDBT 2008»
16 years 6 months ago
Revisiting redundancy and minimization in an XPath fragment
Redundancy and minimization of queries are investigated in a well known fragment of XPath that includes child and descendant edges, branches, wildcards, and multiple output nodes....
Benny Kimelfeld, Yehoshua Sagiv
LOPSTR
2009
Springer
16 years 1 months ago
LP with Flexible Grouping and Aggregates Using Modes
We propose a new grouping operator for logic programs based on the group_by operator of SQL. The novelty of our proposal lies in the use of modes, which allows us to relax some rat...
Marcin Czenko, Sandro Etalle
TABLEAUX
2009
Springer
16 years 1 months ago
Goal-Directed Invariant Synthesis for Model Checking Modulo Theories
We are interested in automatically proving safety properties of infinite state systems. We present a technique for invariant synthesis which can be incorporated in backward reacha...
Silvio Ghilardi, Silvio Ranise
ICDM
2007
IEEE
118views Data Mining» more  ICDM 2007»
16 years 26 days ago
Subgraph Support in a Single Large Graph
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
Mathias Fiedler, Christian Borgelt
AUSAI
2007
Springer
16 years 22 days ago
Temporal Extensions to Defeasible Logic
In this paper, we extend Defeasible Logic (a computationally-oriented non-monotonic logic) in order to deal with temporalised rules. In particular, we extend the logic to cope with...
Guido Governatori, Paolo Terenziani