150 search results - page 12 / 30 » Understanding Promise Theory Using Rewriting Logic |
94
Voted
KR
2000
Springer
15 years 1 months ago
2000
Springer
When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to a...
108
click to vote
PEPM
2010
ACM
14 years 11 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
101
click to vote
SAT
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. A promising approach for model counting was recently introduced, which in theory requires the use of large random xor or parity constraints to obtain near-exact counts of...
SYNTHESE
2011
14 years 4 months ago
2011
We address the old question whether a logical understanding of Quantum Mechanics requires abandoning some of the principles of classical logic. Against Putnam and others1 , our an...
LPNMR
2005
Springer
15 years 2 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, ...