Sciweavers

977 search results - page 94 / 196
» Logic programming with infinite sets
Sort
View
FOSSACS
2000
Springer
15 years 4 months ago
A Program Refinement Framework Supporting Reasoning about Knowledge and Time
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...
Kai Engelhardt, Ron van der Meyden, Yoram Moses
ICPADS
1996
IEEE
15 years 4 months ago
Transactional programming for distributed agent systems
A new multiagent programmingparadigm based on the transactional logic model' is developed. This paradigm enables us to construct a Distributed agent transactional program (DA...
V. K. Murthy
100
Voted
FOSSACS
2009
Springer
15 years 7 months ago
Realizability of Concurrent Recursive Programs
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...
Benedikt Bollig, Manuela-Lidia Grindei, Peter Habe...
103
Voted
AAAI
2006
15 years 2 months ago
kFOIL: Learning Simple Relational Kernels
A novel and simple combination of inductive logic programming with kernel methods is presented. The kFOIL algorithm integrates the well-known inductive logic programming system FO...
Niels Landwehr, Andrea Passerini, Luc De Raedt, Pa...
116
Voted
FLOPS
1999
Springer
15 years 4 months ago
Using Types as Approximations for Type Checking Prolog Programs
Abstract. Subtyping tends to undermine the effects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present...
Christoph Beierle, Gregor Meyer