143 search results - page 15 / 29 » Termination of Well-Typed Logic Programs |
GECCO
2005
Springer
14 years 28 days ago
2005
Springer
We have investigated the potential for using genetic programming to evolve compiler parsing and translation routines for processing arithmetic and logical expressions as they are ...
SEMWEB
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. The Rule Interchange Format Production Rule Dialect (RIFPRD) is a W3C Recommendation to define production rules for the Semantic Web, whose semantics is defined operation...
ESWS
2009
Springer
14 years 2 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...
POPL
2006
ACM
14 years 7 months ago
2006
ACM
This paper specifies, via a Hoare-like logic, an interprocedural and flow sensitive (but termination insensitive) information flow analysis for object-oriented programs. Pointer a...
IPPS
2002
IEEE
14 years 10 days 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...