3663 search results - page 107 / 733 » Problems in the ontology of computer programs |
NMR
2004
Springer
15 years 3 months ago
2004
Springer
We develop an Answer Set Programming formalism based on Default Logic. We show that computing generating sets of extensions in this formalism captures all ΣP 2 search problems.
DAGSTUHL
2007
14 years 11 months ago
2007
The problem of deciding the probability model equivalence of two PRISM programs is addressed. In the finite case this problem can be solved (albeit slowly) using techniques from a...
ACE
2004
14 years 11 months ago
2004
Contrary to the apparent beliefs of many students, computer programming and problem solving are not amenable to purely book learning. These skills can be acquired only by practice...
INFORMS
2010
14 years 7 months ago
2010
Two-step MIR inequalities are valid inequalities derived from a facet of a simple mixedinteger set with three variables and one constraint. In this paper we investigate how to eff...
103
click to vote
GPEM
2010
14 years 8 months ago
2010
Abstract Self-Modifying Cartesian Genetic Programming (SMCGP) is a general purpose, graph-based, developmental form of Genetic Programming founded on Cartesian Genetic Programming....