Well-Founded Semantics for Extended Logic Programs With Dynamic Preferences

Journal of Artificial Intelligence Research - United States
doi 10.1613/jair.284
Full Text
Abstract

Available in full text

Date
Authors
Publisher

AI Access Foundation

Related search

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

On the Semantics of Logic Programs With Preferences

Journal of Artificial Intelligence Research
Artificial Intelligence
2007English

Hybrid Rules With Well-Founded Semantics

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

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

Annals of Pure and Applied Logic
Logic
2008English

Declarative Semantics for Contradictory Modular Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1994English

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

Artificial Intelligence
LinguisticsLanguageArtificial Intelligence
2011English

A Statistical Learning Method for Logic Programs With Distribution Semantics

1995English

Stable Model Semantics for Founded Bounds

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

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy