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
Posted Content
Each normal logic program has a 2-valued Minimal Hypotheses semantics
TL;DR: This paper explores a unifying approach --- that of hypotheses assumption --- as a means to provide a semantics for all Normal Logic Programs (NLPs), the Minimal Hypotheses (MH) semantics, which takes a positive hypotheses assumption approach as a mean to guarantee the desirable properties of model existence, relevance and cumulativity.
Modularity in answer set programs
TL;DR: In this thesis a linear and faithful transformation embedding parallel and prioritized circumscription into ASP is provided, which enhances the knowledge representation capabilities of answer set programming by allowing the use of existing ASP solvers for computing parallel and priority circumscription.
Journal ArticleDOI
A framework for modular ERDF ontologies
TL;DR: A framework for modular ERDF ontologies, called modularERDF framework, is proposed, which enables collaborative reasoning over a set of ERDFOntologies, while support for hidden knowledge is also provided and the ERDF #n-stable model semantics is defined.
Proceedings Article
An argumentation-theoretic approach to reasoning with specificity
Phan Minh Dung,Tran Cao Son +1 more
TL;DR: A new argumentation-theoretic approach to default reasoning with speci-city where the context sensitive priorities between defaults are captured by the attacks-relation between the arguments.
Proceedings Article
A monotonicity theorem for extended logic programs
TL;DR: It is shown that for a restricted class of extended logic programs, those with signings, it is possible to state a fairly general theorem comparing the entailments of programs, and a theorem characterizing a restricted monotonicity property for signed extended programs is established.