Sciweavers

567 search results - page 41 / 114
» Probabilistic Reasoning With Answer Sets
Sort
View
ICTAI
2007
IEEE
15 years 4 months ago
Establishing Logical Rules from Empirical Data
We review a method of generating logical rules, or axioms, from empirical data. This method, using closed set properties of formal concept analysis, has been previously described ...
John L. Pfaltz
AI
2011
Springer
14 years 4 months ago
Stable models and circumscription
The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programmi...
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz
CORR
2012
Springer
217views Education» more  CORR 2012»
13 years 5 months ago
An Adaptive Mechanism for Accurate Query Answering under Differential Privacy
We propose a novel mechanism for answering sets of counting queries under differential privacy. Given a workload of counting queries, the mechanism automatically selects a differ...
Chao Li, Gerome Miklau
CONCUR
2001
Springer
15 years 2 months ago
Symbolic Computation of Maximal Probabilistic Reachability
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
EDBTW
2006
Springer
15 years 1 months ago
Semantically Correct Query Answers in the Presence of Null Values
For several reasons a database may not satisfy a given set of integrity constraints (ICs), but most likely most of the information in it is still consistent with those ICs; and cou...
Loreto Bravo, Leopoldo E. Bertossi