scispace - formally typeset
Open AccessProceedings Article

Logic programs with classical negation

Michael Gelfond, +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 Article

Checking Proof Transformations with ASP.

TL;DR: The means to automatize the check of proof transformations by using Answer Set Prog ramming (ASP) are outlined.
Book ChapterDOI

Answer Sets and Nonmonotonic S4

TL;DR: This work provides here a complete logical characterisation of answer set inference as a subsystem of nonmonotonic S4, and makes use of the well-known Godel embedding of N to modal S4 to show that the inference relation associated with the answer set semantics is equivalent to that of non monotony S4.
Posted Content

Common sense for concurrency and strong paraconsistency using unstratified inference and reflection

Carl Hewitt
TL;DR: In this article, a strongly paraconsistent formalism called DirectLogic (TM) is proposed, which incorporates the mathematics of Computer Science and allows unstratified inference and reflection using mathematical induction for almost all of classical logic to be used.
Book ChapterDOI

Reasoning about Actual and Hypothetical Occurrences of Concurrent and Non-Deterministic Actions

TL;DR: To perform nontrivial reasoning an intelligent agent situated in a changing domain needs the knowledge of causal laws that describe effects of actions changing the domain, the ability to observe and record occurrences of these actions, and the truth values of fluents at particular moments of time.
Journal ArticleDOI

A rule based knowledge transaction model for mobile environments

TL;DR: A rule based knowledge transaction model that integrates the features of both mobile environments and intelligent agents and has a declarative semantics inherited from logic programming is proposed and formalized.