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
Book ChapterDOI

Inferring Executable Models from Formalized Experimental Evidence

TL;DR: This paper introduces an automated method for deriving executable models from formalized experimental findings called datums, which identifies the relevant data in a collection of datums and translates the information contained in datums to logical assertions.
Proceedings Article

Optative reasoning with scenario semantics

TL;DR: This work introduces into the scenario semantics paradigm a general exible notion of optative acceptance of acceptable hypotheses, and proceeds to illustrate its application to fault diagnosis, taxonomic reasoning, and declarative logic program debugging.
Journal ArticleDOI

A system for automatic structure discovery and reasoning-based navigation of the web

TL;DR: The overall principle is to create intelligent software agents used to assist visually impaired individuals in accessing complex on-line data organizations in a meaningful way to improve Web accessibility for users with visual disabilities.
Journal Article

From rough sets to rough knowledge bases

TL;DR: This paper presents an expressive language for representing knowledge about vague concepts based on the rough set formalism and it caters for implicit definition of rough relations by combining different regions of other rough relations.
Book ChapterDOI

Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs

TL;DR: The main result is that binary and unary rules are strictly more expressive than unary and atomic rules, respectively, even if the authors consider normal logic programs where negative literals may appear in the bodies of rules.