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

ACM Transactions on Computational Logic- United States

doi 10.1145/1877714.1877717

Full Text

Abstract

Available in

Date

Authors

Publisher

Association for Computing Machinery (ACM)

Related search

Well-Founded Semantics for Extended Logic Programs With Dynamic Preferences

Journal of Artificial Intelligence Research
Artificial Intelligence
1996English

Extending Logic Programs With Description Logic Expressions for the Semantic Web

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
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

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

Annals of Pure and Applied Logic
Logic
2008English

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

Artificial Intelligence
LinguisticsLanguageArtificial Intelligence
2011English

Hybrid Rules With Well-Founded Semantics

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

Declarative Semantics for Contradictory Modular Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1994English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Totally Correct Logic Program Transformations via Well-Founded Annotations

Higher-Order and Symbolic Computation
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy