Stable Model Semantics for Founded Bounds

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

Available in full text

Date
Authors
Publisher

Cambridge University Press (CUP)

Related search

Hybrid Rules With Well-Founded Semantics

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

Approximating the Stable Model Semantics Is Hard

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
1996English

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

Annals of Pure and Applied Logic
Logic
2008English

A Complete Axiomatic Semantics for the CSP Stable-Failures Model

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

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

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

Artificial Intelligence
LinguisticsLanguageArtificial Intelligence
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

Template Semantics for Model-Based Notations

IEEE Transactions on Software Engineering
Software
2003English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy