191 search results - page 14 / 39 » Propositional theories are strongly equivalent to logic prog... |
210
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
The probability theory is a well-studied branch of mathematics, in order to carry out formal reasoning about probability. Thus, it is important to have a logic, both for computati...
153
click to vote
LPNMR
2007
Springer
16 years 6 days ago
2007
Springer
Abstract. We present a purely model-theoretic semantics for disjunctive logic programs with negation, building on the infinite-valued approach recently introduced for normal logic...
168
click to vote
LPNMR
2004
Springer
15 years 11 months ago
2004
Springer
We investigate mca-programs, that is, logic programs with clauses built of monotone cardinality atoms of the form kX , where k is a non-negative integer and X is a finite set of ...
186
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
156
click to vote
LPNMR
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, ...