4940 search results - page 202 / 988 » On the Complexity of Universal Programs |
161
click to vote
IEEEPACT
2006
IEEE
16 years 14 days ago
2006
IEEE
Modeling and analysis of program behavior are at the foundation of computer system design and optimization. As computer systems become more adaptive, their efficiency increasingly...
147
click to vote
SUM
2009
Springer
16 years 29 days ago
2009
Springer
Abstract. In this paper we introduce a fixpoint semantics for quantitative logic programming, which is able to both combine and correlate evidence from different sources of infor...
184
click to vote
ARTS
1999
Springer
15 years 10 months ago
1999
Springer
Program compilation can be formally defined as a sequence of equivalence-preserving transformations, or refinements, from highlevel language programs to assembler code. Recent mo...
150
click to vote
EUSFLAT
2003
15 years 7 months ago
2003
The concept of homogeneous multi-adjoint logic program is introduced, and a procedure to homogenize an arbitrary multi-adjoint logic program is presented. The procedure is proved ...
165
click to vote
IPL
2006
15 years 6 months ago
2006
This paper compares Propositional Dynamic Logic of Non-Regular Programs and Fixpoint Logic with Chop. It identifies a fragment of the latter which is equiexpressive to the former....