154 search results - page 6 / 31 » PAC-Learnability of Determinate Logic Programs |
PPDP
2010
Springer
13 years 8 months ago
2010
Springer
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
HYBRID
2004
Springer
14 years 3 months ago
2004
Springer
We present a new high-level programming language, called XGIOTTO, for programming applications with hard real-time constraints. Like its predecessor, XGIOTTO is based on the LET (l...
ESOP
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed ...
JOLLI
2008
13 years 9 months ago
2008
This paper adds temporal logic to public announcement logic (PAL) and dynamic epistemic logic (DEL). By adding a previous-time operator to PAL, we express in the language statemen...
LPNMR
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. We consider the simplification of logic programs under the stablemodel semantics, with respect to the notions of strong and uniform equivalence between logic programs, r...