14 search results - page 2 / 3 » Stable Model Counting and Its Application in Probabilistic L... |
PADL
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. For practical applications, the use of top-down query-driven proofprocedures is essential for an efficient use and computation of answers using Logic Programs as knowledg...
ICLP
2010
Springer
13 years 8 months ago
2010
Springer
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. de nite clause programs containing probabilistic facts with a ...
ICTAI
2007
IEEE
13 years 11 months ago
2007
IEEE
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 ...
HYBRID
2010
Springer
13 years 11 months ago
2010
Springer
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...