3663 search results - page 34 / 733 » Problems in the ontology of computer programs |
POPL
1996
ACM
14 years 24 days ago
1996
ACM
This paper presents program analyses and transformations that discover a general class of auxiliary information for any incremental computation problem. Combining these techniques...
FCCM
2008
IEEE
14 years 3 months ago
2008
IEEE
The map-reduce model requires users to express their problem in terms of a map function that processes single records in a stream, and a reduce function that merges all mapped out...
IJPRAI
2010
13 years 5 months ago
2010
This paper investigates what kinds of information are necessary and sufficient to design and evaluate image processing software programs and proposes a representation of these inf...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
AAAI
2012
11 years 11 months ago
2012
Temporal Action Logics (TAL) is a class of temporal logics for reasoning about actions. We present a reformulation of TAL in Answer Set Programming (ASP), and discuss some synergi...