Symmetric structure in logic programming
β Scribed by Jin-Zhao Wu; Harald Fecher
- Publisher
- Springer
- Year
- 2004
- Tongue
- English
- Weight
- 775 KB
- Volume
- 19
- Category
- Article
- ISSN
- 1000-9000
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A variant of the notion of symmetric constructive realizability is introduced where the information about the symmetric constructive truth or falsity of an arithmetical formula is expressed by a single natural number. The methods of transformations of such a realization to the realizations of known
We introduce a logic programming language which supports hypothetical and counterfactual reasoning. The language is based on a conditional logic which enables to formalize conditional updates of the knowledge base. Due to the presence of integrity constraints, alternative revisions of the knowledge
The efficient learnability of restricted classes of logic programs is studied in the PAC framework of computational learning theory. We develop the product homomorphism method, which gives polynomial PAC learning algorithms for a nonrecursive Horn clause with function-free ground background knowledg