Sciweavers

8232 search results - page 401 / 1647
» Dynamic Logic Programming
Sort
View
LPNMR
2007
Springer
16 years 28 days ago
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
Michael Fink, Reinhard Pichler, Hans Tompits, Stef...
NMELP
1994
15 years 11 months ago
Static Semantics as Program Transformation and Well-founded Computation
In this paper, we propose a new constructive characterization of those semantics for disjunctive logic programs which are extensions of the well-founded semantics for normal progra...
Stefania Costantini, Gaetano Aurelio Lanzarone
176
Voted
VLDB
1991
ACM
128views Database» more  VLDB 1991»
15 years 10 months ago
A Functional Programming Approach to Deductive Databases
We introduce a persistentfunctional languagecalled PFL which adapts functional programming to the area of deductive databases,much as logic-based deductive databaselanguagesadapt ...
Alexandra Poulovassilis, Carol Small
159
Voted
GECCO
2006
Springer
148views Optimization» more  GECCO 2006»
15 years 10 months ago
Behavioural GP diversity for dynamic environments: an application in hedge fund investment
We present a new mechanism for preserving phenotypic behavioural diversity in a Genetic Programming application for hedge fund portfolio optimization, and provide experimental res...
Wei Yan, Christopher D. Clack
AO
2007
80views more  AO 2007»
15 years 7 months ago
Problems in the ontology of computer programs
As a first step in the larger project of charting the ontology of computer programs, we pose three central questions: (1) Can programs, hardware, and metaprograms be organized into...
Amnon H. Eden, Raymond Turner