Sciweavers

3 search results - page 1 / 1
» Davis-Putnam Style Rules for Deciding Property S
Sort
View
FUIN
2007
93views more  FUIN 2007»
13 years 4 months ago
Davis-Putnam Style Rules for Deciding Property S
Two set systems E, F on an underlying set V will be said to have Property S if there exists a subset σ of V , such that σ ∩ e = ∅, for all e ∈ E and f ⊆ σ, for all f âˆ...
Robert Cowen, Adam Kolany
CORR
2010
Springer
68views Education» more  CORR 2010»
13 years 4 months ago
An Optimization for Reasoning with Forest Logic Programs
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
Cristina Feier, Stijn Heymans
ICDT
2009
ACM
248views Database» more  ICDT 2009»
14 years 5 months ago
Automatic verification of data-centric business processes
We formalize and study business process systems that are centered around "business artifacts", or simply "artifacts". This approach focuses on data records, kn...
Alin Deutsch, Richard Hull, Fabio Patrizi, Victor ...