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

Theory and Practice of Logic Programming - United Kingdom
doi 10.1017/s1471068418000108
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Cambridge University Press (CUP)

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

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

Annals of Pure and Applied Logic
Logic
2008English

Hybrid Rules With Well-Founded Semantics

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

The Alternating Fixpoint of Logic Programs With Negation

1989English

Categories for Fixpoint-Semantics

1976English

On the Semantics of Logic Programs With Preferences

Journal of Artificial Intelligence Research
Artificial Intelligence
2007English

Revisiting the Semantics of Interval Probabilistic Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Implementing Type Theory in Higher Order Constraint Logic Programming

Mathematical Structures in Computer Science
MathematicsComputer Science Applications
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy