Sciweavers

8132 search results - page 376 / 1627
» Dependability, Abstraction, and Programming
Sort
View
UAI
2003
15 years 8 months ago
CLP(BN): Constraint Logic Programming for Probabilistic Knowledge
Abstract. In Datalog, missing values are represented by Skolem constants. More generally, in logic programming missing values, or existentially quantified variables, are represent...
Vítor Santos Costa, David Page, Maleeha Qaz...
APLAS
2010
ACM
15 years 7 months ago
Verification of Tree-Processing Programs via Higher-Order Model Checking
Abstract. We propose a new method to verify that a higher-order, treeprocessing functional program conforms to an input/output specification. Our method reduces the verification pr...
Hiroshi Unno, Naoshi Tabuchi, Naoki Kobayashi
AAMAS
2006
Springer
15 years 7 months ago
Verifying Multi-agent Programs by Model Checking
Abstract. This paper gives an overview of our recent work on an approach to verifying multi-agent programs. We automatically translate multi-agent systems programmed in the logic-b...
Rafael H. Bordini, Michael Fisher, Willem Visser, ...
ENTCS
2008
101views more  ENTCS 2008»
15 years 7 months ago
Imperative LF Meta-Programming
Logical frameworks have enjoyed wide adoption as meta-languages for describing deductive systems. While the techniques for representing object languages in logical frameworks are ...
Aaron Stump
KI
2008
Springer
15 years 6 months ago
Analysis and Evaluation of Inductive Programming Systems in a Higher-Order Framework
Abstract. In this paper we present a comparison of several inductive programming (IP) systems. IP addresses the problem of learning (recursive) programs from incomplete specificati...
Martin Hofmann 0008, Emanuel Kitzelmann, Ute Schmi...