Generating Efficient, Terminating Logic Programs

Lecture Notes in Computer Science - Germany
doi 10.1007/bfb0030603
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Pac-Learning Recursive Logic Programs: Efficient Algorithms

Journal of Artificial Intelligence Research
Artificial Intelligence
1995English

Developing Correct and Efficient Logic Programs by Transformation*

Knowledge Engineering Review
Artificial IntelligenceSoftware
1996English

Disjunctive Signed Logic Programs

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
1997English

Generating Hardware From OpenMP Programs

2006English

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

An Extension Strategy of Concolic Testing for Intentionally Non-Terminating Programs

2018English

Determinacy Inference for Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Learnability of Constrained Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy