About: Stable model semantics

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Stable model semantics Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FStable_model_semantics&invfp=IFP_OFF&sas=SAME_AS_OFF

The concept of a stable model, or answer set, is used to define a declarative semantics for logic programs with negation as failure. This is one of several standard approaches to the meaning of negation in logic programming, along with program completion and the well-founded semantics. The stable model semantics is the basis ofanswer set programming.

Attributes	Values
rdfs:label	Sémantique des modèles stables (fr) Semantica del modello stabile (it) Stable model semantics (en) Semântica de modelo estável (pt) Семантика стійких моделей (uk)
rdfs:comment	The concept of a stable model, or answer set, is used to define a declarative semantics for logic programs with negation as failure. This is one of several standard approaches to the meaning of negation in logic programming, along with program completion and the well-founded semantics. The stable model semantics is the basis ofanswer set programming. (en) La sémantique des modèles stables est une sémantique déclarative en programmation logique utilisant la négation par l'échec. C'est l'une des nombreuses approches standard pour la signification de la négation dans la programmation logique, au côté de la terminaison de programme et de la sémantique bien fondée. La sémantique du modèle stable est à la base du langage de programmation déclarative Answer Set Programming (ASP). (fr) Il modello stabile (stable model), o answer set, è un concetto utilizzato per definire una semantica dichiarativa nella programmazione logica con negazione. Il concetto di modello stabile, introdotto da Gelfond e Lifschitz nel 1988, è alla base dell'answer set programming. (it) O conceito de modelo estável, ou conjunto de respostas, é usado para definir uma semântica declarativa em programas lógicos com negação por falha. Esta é uma das várias abordagens para o significado da negação na lógica de programação, juntamente com a completude do programa e a semântica bem formada. A semântica de modelo estável é a base da programação de conjunto de resposta. (pt) Поняття стійко́ї моде́лі (англ. stable model), або набору відповідей, застосовується для визначення декларативних семантик для логічних програм із запереченням як відмовою. Це один із декількох стандартних підходів до значення заперечення в логічному програмуванні, поряд із повнотою програми та . Семантики стійких моделей є основою програмування наборами відповідей. (uk)
dcterms:subject	Logic programming Model theory
Wikipage page ID	4224978 (xsd:integer)
Wikipage revision ID	1117628313 (xsd:integer)
Link from a Wikipage to another Wikipage	Prolog Propositional formula Model theory Negation as failure Answer set programming Antecedent (logic) Antichain Default logic Consequent Negation Open world assumption Modal operator NP-complete Closed world assumption Kripke semantics Propositional logic Truth value Logic programming Michael Gelfond Knowledge representation Tautology (logic) Logic programming Model theory John McCarthy (computer scientist) Eight queens puzzle Autoepistemic logic Polynomial hierarchy Ground expression SLD resolution Semantics (computer science) Well-founded semantics Nonmonotonic logic Literal (mathematical logic) Truth tables Inference rule
Link from a Wikipage to an external page	http://www.cs.utexas.edu/users/vl/papers/clnegdd.ps http://www.cs.utexas.edu/users/vl/papers/mfasp.ps http://www.cs.utexas.edu/users/vl/papers/stable.ps https://dx.doi.org/10.1016/0004-3702%2887%2990043-9 http://www.doc.ic.ac.uk/~rak/papers/kowalski-van_emden.pdf http://www.kr.tuwien.ac.at/staff/eiter/et-archive/ilps93.ps.gz http://www.cs.ust.hk/faculty/flin/papers/assat-aij-revised.pdf http://ai2-s2-pdfs.s3.amazonaws.com/37f3/19f2f8af842631ff9972e1bfd91b99f93511.pdf https://link.springer.com/chapter/10.1007/11546207_10 https://www.researchgate.net/publication/220492237 http://www.umiacs.umd.edu/~horty/courses/readings/reiter-default-1980.pdf https://www.aaai.org/Papers/AAAI/1987/AAAI87-037.pdf
sameAs	Stable model semantics Stable model semantics Stable model semantics Stable model semantics Stable model semantics Stable model semantics Stable model semantics
dbp:wikiPageUsesTemplate	dbt:Cite_book dbt:Cite_journal dbt:Mvar dbt:Reflist dbt:Tmath
has abstract	The concept of a stable model, or answer set, is used to define a declarative semantics for logic programs with negation as failure. This is one of several standard approaches to the meaning of negation in logic programming, along with program completion and the well-founded semantics. The stable model semantics is the basis ofanswer set programming. (en) La sémantique des modèles stables est une sémantique déclarative en programmation logique utilisant la négation par l'échec. C'est l'une des nombreuses approches standard pour la signification de la négation dans la programmation logique, au côté de la terminaison de programme et de la sémantique bien fondée. La sémantique du modèle stable est à la base du langage de programmation déclarative Answer Set Programming (ASP). (fr) Il modello stabile (stable model), o answer set, è un concetto utilizzato per definire una semantica dichiarativa nella programmazione logica con negazione. Il concetto di modello stabile, introdotto da Gelfond e Lifschitz nel 1988, è alla base dell'answer set programming. (it) O conceito de modelo estável, ou conjunto de respostas, é usado para definir uma semântica declarativa em programas lógicos com negação por falha. Esta é uma das várias abordagens para o significado da negação na lógica de programação, juntamente com a completude do programa e a semântica bem formada. A semântica de modelo estável é a base da programação de conjunto de resposta. (pt) Поняття стійко́ї моде́лі (англ. stable model), або набору відповідей, застосовується для визначення декларативних семантик для логічних програм із запереченням як відмовою. Це один із декількох стандартних підходів до значення заперечення в логічному програмуванні, поряд із повнотою програми та . Семантики стійких моделей є основою програмування наборами відповідей. (uk)
prov:wasDerivedFrom	wikipedia-en:Stable_model_semantics?oldid=1117628313&ns=0
page length (characters) of wiki page	31709 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Stable_model_semantics
is Link from a Wikipage to another Wikipage of	Negation as failure Answer set programming DLV Vladimir Lifschitz François Fages Glossary of artificial intelligence Closed-world assumption Horn clause Logic programming Non-monotonic logic Frame problem Michael Gelfond Rule Interchange Format Autoepistemic logic Open-world assumption Well-founded semantics Answer set Answer set semantics Stable model

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 59 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software