1204 search results - page 94 / 241 » Termination of Polynomial Programs |
125
Voted
ESWS
2009
Springer
15 years 10 months ago
2009
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. Although several decidable fragments of OASP have been identified, few reasonin...
135
click to vote
IPPS
2002
IEEE
15 years 8 months ago
2002
IEEE
Tabling or memoing is a technique where one stores intermediate answers to a problem so that they can be reused in further calls. Tabling is of interest to logic programming becau...
110
Voted
ICFP
2008
ACM
16 years 3 months ago
2008
ACM
The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equ...
142
Voted
BIRTHDAY
2007
Springer
15 years 9 months ago
2007
Springer
Showing termination of the Battle of Hercules and Hydra is a challenge. We present the battle both as a rewrite system and as an arithmetic while program, provide proofs of their t...
131
Voted
RTCSA
2005
IEEE
15 years 9 months ago
2005
IEEE
We propose a new architecture for a content protection system that conceals confidential data and algorithms in an FPGA as electrical circuits. This architecture is designed for a...