article · 2008

THE STABLE MODEL SEMANTICS FOR LOGIC PROGRAMMING

Cited by 0Abstract and details only

Abstract

Abstract We propose a new declarative semantics for logic programs with negation. Its formulation is quite simple; at the same time, it is more general than the iterated fixed point semantics for stratified programs, and is applicable to some useful programs that are not stratified. 1. Introduction This paper belongs to the direction of research which attempts to define the declarative meaning of logic programs by means of &amp;quot;canonical models&amp;quot;. The programs under consideration are sets of rules of the form A L1; : : : ; Lm (1)

Cite this paper

APA 7

(2008). THE STABLE MODEL SEMANTICS FOR LOGIC PROGRAMMING.

MLA 9

“THE STABLE MODEL SEMANTICS FOR LOGIC PROGRAMMING.” 2008.

Chicago

2008. “THE STABLE MODEL SEMANTICS FOR LOGIC PROGRAMMING.”

Harvard

(2008) ‘THE STABLE MODEL SEMANTICS FOR LOGIC PROGRAMMING’.

BibTeX

@article{anon2008stable,
  title = {{THE STABLE MODEL SEMANTICS FOR LOGIC PROGRAMMING}},
  year = {2008}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.