725 search results - page 37 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
121
Voted
CSL
2003
Springer
15 years 7 months ago
2003
Springer
Quantum computation deals with projective measurements and unitary transformations in finite dimensional Hilbert spaces. The paper presents a propositional logic designed to descr...
117
Voted
ICFP
2008
ACM
16 years 2 months ago
2008
ACM
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
126
click to vote
CIE
2007
Springer
15 years 8 months ago
2007
Springer
The intuition guiding the de…nition of computation has shifted over time, a process that is re‡ected in the changing formulations of the Church-Turing thesis. The theory of co...
135
click to vote
LPNMR
2001
Springer
15 years 7 months ago
2001
Springer
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
147
Voted
CASC
2006
Springer
15 years 6 months ago
2006
Springer
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...