154 search results - page 8 / 31 » PAC-Learnability of Determinate Logic Programs |
CORR
2006
Springer
13 years 10 months ago
2006
Springer
The refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specificat...
ICLP
1999
Springer
14 years 2 months ago
1999
Springer
A declarative programming language has two kinds of semantics. The tract helps in reasoning about speci cations and correctness, while an operational semantics determines the mann...
LPNMR
2009
Springer
14 years 4 months ago
2009
Springer
Modular nonmonotonic logic programs (MLPs) under the answer-set semantics have been recently introduced as an ASP formalism in which modules can receive context-dependent input fro...
AAAI
1994
13 years 11 months ago
1994
We consider using machine learning techniques to help understand a large software system. In particular, we describe how learning techniques can be used to reconstruct abstract Da...
UC
2009
Springer
14 years 4 months ago
2009
Springer
We present a logical approach to the separability analysis issue for a functional quantum computation language. This logic is inspired by previous works on logical analysis of alia...