The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Zbigniew (PL-WASWTM; Warsaw) ; Truszczynski, Mirostaw (1-K Y-C; Lexington, KY) Fixed-parameter complexity of semantics for logic programs. ... This provides a precise logical account of the abstract domain Pos and of other domains for groundness analysis of logic programs. The paper is very well written and self-contained. ...
The paper shows that a logical semantics based on this has the desired coincidence properties. ... "Optimal domains for disjunctive abstract interpretation" by Roberto Giacobazzi and Francesco Ranzato gives insight into what are the basic constituents of program analyses. ...doi:10.1016/s0167-6423(97)00028-2 fatcat:v6gefs3z5vf7rpevb4trx5wuty
“We describe a method for identifying, for any abstract domain D and for each property P expressed by D, the subset of D that is useful for computing P-information. ... Summary: “The class of logic programs with negation as failure in the head is a subset of the logic of MBNF introduced by Lifschitz and is an extension of the class of extended disjunctive programs. ...
We also define the well-founded semantics for the normal case, where normal programs are combined with tractable description logics, and we explore its semantic and computational properties. ... We present a novel combination of disjunctive programs under the answer set semantics with description logics for the Semantic Web. ... We also draw a precise picture of their complexity. • We also define the well-founded semantics for the special case of normal dl-programs, and explore its semantic and computational properties. ...doi:10.1109/tkde.2010.111 fatcat:okrzhm37b5du3efa34rbcephpq
for disjunctive logic programs and deductive databases. ... semantics for disjunctive programs). ...
Summary: “There are three most prominent semantics defined for certain subclasses of disjunctive logic programs: GCWA (for positive programs), perfect (for stratified programs), and stable (defined for ... “The main result of the paper is the definition of a fixpoint se- mantics for normal CLP programs which is fully abstract for the observation of computed answer constraints. ...
This section is subdivided into several subsections, which deal with the following: normal and extended logic programs; disjunctive logic programs; abductive logic programs; and complexity and properties ... The satisfaction of these properties is related to the complexity of the semantics. ...doi:10.1016/0743-1066(93)90028-f fatcat:zs5h4ximffdfvapevyr6rvs4fm
The author is able to express within this framework most of the major semantics of ’ 68 COMPUTER SCIENCE 4998 normal and disjunctive logic programs and of logic programs with classical negation, using ... Summary: “In this paper, we propose a new constructive charac- terization of those semantics for disjunctive logic programs which are extensions of the well-founded semantics for normal programs. ...
Summary: “By translating each disjunctive logic program into an abductive framework, a declarative semantics for the class of disjunctive logic programs, called the typical abductive semantics (TAS), is ... This semantics not only is a simple and intuitive framework for performing argumentation and abduction in DLP, but also provides a unifying framework for many key semantics of disjunctive logic programs ...
In the context of knowledge representation, by considering ideas from possibilistic logic and answer set programming approach, we define a possibilistic disjunctive logic programming approach for modelling ... In order to define the semantics of the possibilistic disjunctive programs, three approaches are defined: ... This framework generalizes any logic programming semantics in order to build logic programming semantics, which are always defined, satisfy the property of relevance and agree with the answer set semantics ...doi:10.1017/s0269888910000238 fatcat:ic34qr5vpbbo7ofrwq4c4snzhe
We present a new and general approach for defining, understanding, and computing logic programming semantics. ... We consider disjunctive programs for generality, but our results are still interesting if speciahzed to normal programs. ... Program tran.¢brmations We base our discussion on abstract properties of logic programming semantics. ...doi:10.1016/s0743-1066(98)10030-4 fatcat:3ttrlcww4zebrbkpvbnrfyckni
Lecture Notes in Computer Science
We apply our method to a well known analysis for logic programs: the depth(k) analysis for approximating the set of computed answers. The analysis is correct w.r.t. ... Keywords: Abstract interpretation, static analysis, logic programming, constructive negation. c ( (c)) = ; 0 c (c) where 0 = 9Y 1 ; 9Y 2 ; ::; and Y i 2 (W \ V ar( c (c))) c (X = t) = (X = k (t)); c (false ... Constructive negation is a rule of inference introduced by Chan for normal logic programs in 3], which provides normal logic programs with a sound and complete 21] operational semantics w.r.t. ...doi:10.1007/3-540-49727-7_5 fatcat:b7y7qgt7qbfsbn6irqo4u4vyua
) On the computational cost of disjunctive logic programming: propositional case. ... Rajasekar, Foundations of disjunctive logic programming, MIT Press, Cambridge, MA, 1992; MR 93i:68160], but few results on their complexity were known before. ...
We also define a compositional and fully abstract seman- tics for differential programs and we address the importance of this semantics as a formal tool for reasoning on the computational properties of ... For disjunctive programs, we show that the refined semantics [J. ...
-387); Arcot Rajasekar, Trans-epistemic semantics for logic programs (388-400); Francesca Toni and Antonios C. ... theories in general disjunctive programs (344-357); Jiirgen Kalinski, Stable classes and operator pairs for disjunctive pro- grams (358-371); David Pearce, Nonmonotonicity and answer set inference (372 ...
« Previous Showing results 1 — 15 out of 14,437 results