1686 search results - page 86 / 338 » Programs as polygraphs: computability and complexity |
SEMWEB
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. This paper presents a decidable fragment for combining ontologies and rules in order-sorted logic programming. We describe ordersorted logic programming with sort, predic...
ICLP
1997
Springer
15 years 1 months ago
1997
Springer
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the prog...
FOSSACS
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. This paper develops a highly expressive semantic framework for program refinement that supports both temporal reasoning and reasoning about the knowledge of a single agen...
121
click to vote
PPSN
1994
Springer
15 years 1 months ago
1994
Springer
We present the Genetic L-System Programming (GLP) paradigm for evolutionary creation and development of parallel rewrite systems (Lsystems, Lindenmayer-systems) which provide a com...
118
click to vote
CCECE
2006
IEEE
15 years 3 months ago
2006
IEEE
To help programmers of high-performance computing (HPC) systems avoid communication-related errors, we employ a formal process algebra, Communicating Sequential Processes (CSP), w...