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

Annals of Pure and Applied Logic - Netherlands
doi 10.1016/j.apal.2007.10.004
Full Text
Abstract

Available in full text

Categories
Logic
Date
Authors
Publisher

Elsevier BV

Related search

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

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

Well-Founded Semantics for Extended Logic Programs With Dynamic Preferences

Journal of Artificial Intelligence Research
Artificial Intelligence
1996English

Hybrid Rules With Well-Founded Semantics

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

Bialgebraic Semantics for Logic Programming

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2015English

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

Stable Model Semantics for Founded Bounds

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

Comparative Metric Semantics for Commit in Or-Parallel Logic Programming

1997English

Totally Correct Logic Program Transformations via Well-Founded Annotations

Higher-Order and Symbolic Computation
2008English

The Semantics of Equational Logic Programming as an Instance of CLP

1993English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy