Amanote Research

Amanote Research

    RegisterSign In

Learnability of Constrained Logic Programs

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-56602-3_148
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 1993

Authors
Sašo DžeroskiStephen MuggletonStuart Russell
Publisher

Springer Berlin Heidelberg


Related search

Disjunctive Signed Logic Programs

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
1997English

Incremental Analysis of Logic Programs

1995English

Managing Uncertainty and Vagueness in Description Logics, Logic Programs and Description Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Temporally Annotated Extended Logic Programs

International Journal of Advanced Research in Artificial Intelligence
2012English

Disjunctive Logic Programming as Constrained Inferences

1997English

On Termination of Constraint Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

Mode Analysis of Functional Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1994English

Automatic Termination Analysis of Logic Programs

1997English

Determinacy Inference for Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy