Totally Correct Logic Program Transformations via Well-Founded Annotations

Higher-Order and Symbolic Computation
doi 10.1007/s10990-008-9024-6
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

An Infinite-Game Semantics for Well-Founded Negation in Logic Programming

Annals of Pure and Applied Logic
Logic
2008English

Well-Founded Semantics for Extended Logic Programs With Dynamic Preferences

Journal of Artificial Intelligence Research
Artificial Intelligence
1996English

Well-Founded Semantics for Description Logic Programs in the Semantic Web

ACM Transactions on Computational Logic
Computational MathematicsTheoretical Computer ScienceComputer ScienceLogic
2011English

Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs

Theory and Practice of Logic Programming
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceArtificial IntelligenceSoftware
2018English

Hybrid Rules With Well-Founded Semantics

Knowledge and Information Systems
Information SystemsHuman-Computer InteractionHardwareArchitectureArtificial IntelligenceSoftware
2010English

Short Note: Strict Unwraps Make Worker/Wrapper Fusion Totally Correct

Journal of Functional Programming
Software
2010English

Well-Founded Functions and Extreme Predicates in Dafny: A Tutorial

English

Developing Correct and Efficient Logic Programs by Transformation*

Knowledge Engineering Review
Artificial IntelligenceSoftware
1996English

Local Closed World Reasoning With Description Logics Under the Well-Founded Semantics

Artificial Intelligence
LinguisticsLanguageArtificial Intelligence
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy