Filters








61,924 Hits in 1.6 sec

Defining Stage Argumentation Semantics in Terms of an Abducible Semantics

Mauricio Osorio, José Luis Carballido, Claudia Zepeda
2016 Electronical Notes in Theoretical Computer Science  
We also define the stage semantics for a special type of normal programs and present a similar characterization.  ...  We define a new logic programming semantics in terms of abducible atoms. We use it to characterize the stage extensions of an argumentation framework AF by means of an associated normal program PAF .  ...  We define several semantics in terms of abducible atoms and look at some of their properties.  ... 
doi:10.1016/j.entcs.2016.11.006 fatcat:skbfa4wuxfczlndkkpwgkepqoa

Studying Ideal Semantics via Logic Programming Semantics

Juan Carlos Nieves, Mauricio Osorio
2011 2011 10th Mexican International Conference on Artificial Intelligence  
We also show that these extensions of the well-founded semantics define argumentation semantics with similar behaviour to the ideal argumentation semantics.  ...  On the other hand, we introduce a new logic programming semantics which is able to characterize the ideal sets of an argumentation framework.  ...  By considering the reduction , the p-stable semantics for normal programs is defined. Definition 2: [15] Let be a normal program and be a set of atoms.  ... 
doi:10.1109/micai.2011.31 fatcat:kpyaa6yo2vgmfa3cio2uhh3oda

Possibilistic Well-Founded Semantics [chapter]

Mauricio Osorio, Juan Carlos Nieves
2009 Lecture Notes in Computer Science  
We will show that our new semantics can be considered as an approximation of the possibilistic semantics based on the answer set semantics and the pstable semantic.  ...  One of the main implications of having just one model associated to a possibilistic logic program is that one can perform queries directly to a possibilistic program and answering these queries in accordance  ...  An extended normal clause, C, is denoted: a ← a 1 , . . . , a j , not a j+1 , . . . , not a n where j + n ≥ 0, a is an atom and each a i is an atom.  ... 
doi:10.1007/978-3-642-05258-3_2 fatcat:3fdtwr635jbhhopssh37257c5q

Forgetting under the Well-Founded Semantics [chapter]

José Júlio Alferes, Matthias Knorr, Kewen Wang
2013 Lecture Notes in Computer Science  
In this paper, we develop a notion of forgetting for normal logic programs under the well-founded semantics. We show that a number of desirable properties are satisfied by our approach.  ...  Three different algorithms are presented that maintain the computational complexity of the well-founded semantics, while partly keeping its syntactical structure.  ...  Algorithm forget 2 (P, p) Input: Normal logic program P and an atom p in P . Output: A normal logic program P representing forget(P, p). Method: Step 1.  ... 
doi:10.1007/978-3-642-40564-8_4 fatcat:li7ycn5duncy5hx2htugljyzt4

Super logic programs and negation as belief [chapter]

Teodor C. Przymusinski
1996 Lecture Notes in Computer Science  
semantics constitutes an intuitively natural extension of the semantics of normal programs; there is a clear and well-understood relationship between the proposed class of programs and their semantics  ...  is su ciently powerful to precisely determine answers to the above queries and the answers, when restricted to normal logic programs, coincide with those provided by one of the well-established semantics  ...  Alferes and L. Pereira and with S. Brass and Juergen Dix. The author is truly grateful to all of them for their friendly cooperation and invaluable comments.  ... 
doi:10.1007/3-540-60983-0_16 fatcat:wu5mjryrxnfb3asn3w5bufc6zi

A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web

Thomas Lukasiewicz
2010 IEEE Transactions on Knowledge and Data Engineering  
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.  ...  Thus, every such I includes every wellfounded and no unfounded atom a ∈ HB Φ relative to KB . 2  ...  . • 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

On negation in Hilog

Kenneth A Ross
1994 The Journal of Logic Programming  
Let P' be the normal instantiation of P and let Q' be the HiLog instantiation of P. Clearly P' s Q'. Let S be the set of all HiLog atoms from the Herbrand universe that are not normal atoms.  ...  Let S be the set of all HiLog atoms from the Herbrand universe that are not normal atoms.  ... 
doi:10.1016/0743-1066(94)90040-x fatcat:wyrqj2v2kzatrknluuxxtze62u

P-stable models of strong kernel programs

Claudia Zepeda, José Luis Carballido
2009 Journal of Algorithms  
We introduce three different formats for normal programs: Negative normal programs, Restricted negative normal programs and Strong kernel programs.  ...  In this way all the applications based on stable semantics of kernel programs can also be based on p-stable semantics of strong kernel programs.  ...  Finally we give two definitions useful to understand the definitions of stable and p-stable semantics for normal programs. Let P be a normal program and M be a set of atoms.  ... 
doi:10.1016/j.jalgor.2009.02.004 fatcat:t42okwvl7bbkbe4frw4wcvsn54

Well-founded semantics for description logic programs in the semantic web

Thomas Eiter, Giovambattista Ianni, Thomas Lukasiewicz, Roman Schindlauer
2011 ACM Transactions on Computational Logic  
In particular, we show that it generalizes the well-founded semantics for ordinary normal programs.  ...  Here, as a central contribution, we present the well-founded semantics for dl-programs, and we analyze its semantic properties.  ...  Preliminaries In this section, we recall normal programs under the answer set semantics and the wellfounded semantics, and the description logics SHIF(D) and SHOIN (D). Normal Programs.  ... 
doi:10.1145/1877714.1877717 fatcat:i6tdlufjevd7bntn5fvg23fhlq

Well-Founded Semantics for Description Logic Programs in the Semantic Web [chapter]

Thomas Eiter, Thomas Lukasiewicz, Roman Schindlauer, Hans Tompits
2004 Lecture Notes in Computer Science  
In particular, we show that it generalizes the well-founded semantics for ordinary normal programs.  ...  Here, as a central contribution, we present the well-founded semantics for dl-programs, and we analyze its semantic properties.  ...  Preliminaries In this section, we recall normal programs under the answer set semantics and the wellfounded semantics, and the description logics SHIF(D) and SHOIN (D). Normal Programs.  ... 
doi:10.1007/978-3-540-30504-0_7 fatcat:yo47nbzttnhmxftjnglk3om3hm

Non Deterministic Logic Programs [article]

Emad Saad
2013 arXiv   pre-print
These semantics subsume the deterministic stable model semantics and the deterministic well-founded semantics of deterministic normal logic programs, and they reduce to the semantics of deterministic definite  ...  We present a logic programming framework called non deterministic logic programs, along with a declarative semantics and fixpoint semantics, to allow representing and reasoning about inherently non deterministic  ...  However, normal non deterministic logic programs and their stable non deterministic model semantics allow atoms to be non deterministic for which a non deterministic atom is represented by a set of atoms  ... 
arXiv:1304.7168v1 fatcat:sfcljxdfgzf4hgp4kwtxbiaw5e

Extending Logic Programs with Description Logic Expressions for the Semantic Web [chapter]

Yi-Dong Shen, Kewen Wang
2011 Lecture Notes in Computer Science  
In a normal DL logic program arbitrary DL expressions are allowed to appear in rule bodies and atomic DL expressions (i.e., atomic concepts and atomic roles) allowed in rule heads.  ...  We extend the key condition of well-supportedness for normal logic programs under the standard answer set semantics to normal DL logic programs and define an answer set semantics for DL logic programs  ...  This work is supported in part by the National Natural Science Foundation of China (NSFC) grants 60970045 and 60833001, and by the Australia Research Council (ARC) Discovery Projects DP110101042 and DP1093652  ... 
doi:10.1007/978-3-642-25073-6_40 fatcat:2gpgy7qa7zfzzgtdw43niqopju

Extending Well-Founded Semantics with Clark's Completion for Disjunctive Logic Programs

Juan Carlos Nieves, Mauricio Osorio
2018 Scientific Programming  
For normal programs, this semantics is based on suitable integration of the well-founded semantics (WFS) and the Clark's completion.  ...  In this paper, we introduce new semantics (that we call D3-WFS-DCOMP) and compare it with the stable semantics (STABLE).  ...  Sometimes, a clause is denoted by A ← B + , ¬B − , where A contains all the head atoms, B + contains all the positive body atoms, and B − contains all the negative body atoms.  ... 
doi:10.1155/2018/4157030 fatcat:qrcx3fojxjakborqhlnhi5q3oe

On the equivalence of semantics for normal logic programs

Jia-Huai You, Li Yan Yuan
1995 The Journal of Logic Programming  
coincide: the regular model semantics proposed by You and Yuan, the partial stable model semantics by Sacc£ and Zaniolo, the preferential semantics by Dung, and a stronger version of the stable class semantics  ...  Due to its simplicity and naturalness, the framework of normal alternating fixpoints offers great potential in the study of the semantics for various nonmonotonic systems.  ...  Let P be a normal program and E be a set of atoms.  ... 
doi:10.1016/0743-1066(94)00023-y fatcat:f3kndypahzeu5b3srfqpqkklti

Integrating the Completion and the Well Founded Semantics [chapter]

Mauricio Osorio, Bharat Jayaraman
1998 Lecture Notes in Computer Science  
The three most well-known semantics for negation in the logic programming framework are Clark's completion Cla78], the stable semantics GL88], and the well-founded semantics vGRS91].  ...  We present in this paper examples to support these claims, and we introduce a new semantics, called CWFS, which is as powerful as COMP in inferring positive literals and as powerful as WFS in inferring  ...  We may denote a normal clause C as usual Llo87]: a :-l 1 ; : : :; l n , where a is an atom and each l i is a literal; or by a B + ; :B ? , where B + contains all the positive body atoms and B ?  ... 
doi:10.1007/3-540-49795-1_20 fatcat:x3wu4jvy7rbplovxzfylaj2wcy
« Previous Showing results 1 — 15 out of 61,924 results