Open AccessProceedings Article
Logic programs with classical negation
Michael Gelfond,Vladimir Lifschitz +1 more
- pp 579-597
Reads0
Chats0
About:
This article is published in International Conference on Lightning Protection.The article was published on 1990-05-01 and is currently open access. It has received 602 citations till now. The article focuses on the topics: Negation & Predicate functor logic.read more
Citations
More filters
Journal ArticleDOI
A generalization of the Lin-Zhao theorem
TL;DR: The simplification and generalization of the theorem on loop formulas makes the idea of a loop formula applicable to stable models in the sense of a very general definition that covers disjunctive programs, programs with nested expressions, and more.
Posted Content
Defeasible Logic Programming: An Argumentative Approach
TL;DR: Defeasible Logic Programming (DeLP) as discussed by the authors is a formalism that combines results of Logic Programming and defeasible argumentation, and it allows the possibility of representing information in the form of weak rules in a declarative manner.
Journal ArticleDOI
Argument-based critics and recommenders: a qualitative perspective on user support systems
TL;DR: This paper presents a novel approach towards the integration of user support systems, such as critics and recommender systems, with a defeasine argumentation framework to enhance practical reasoning capabilities of current user support tools by incorporating argument-based qualitative inference.
Book ChapterDOI
Answer set programming for the semantic web
TL;DR: The Semantic Web aims at extending the current Web by standards and technologies that help machines to understand the information on the Web so that they can support richer discovery, data integration, navigation, and automation of tasks.
Book ChapterDOI
Chapter 13 Π10 classes in mathematics
Douglas Cenzer,Jeffrey B. Remmel +1 more
TL;DR: In this paper, it was shown that the set of solutions to a given recursive instance of the problem may be represented as an arbitrary (bounded, or recursively bounded) ∏ 0 1 class.