23 Hits in 6.0 sec

FLP answer set semantics without circular justifications for general logic programs

Yi-Dong Shen, Kewen Wang, Thomas Eiter, Michael Fink, Christoph Redl, Thomas Krennwallner, Jun Deng
2014 Artificial Intelligence  
We study in depth the computational complexity of FLP and well-justified FLP answer sets for general classes of logic programs.  ...  The answer set semantics presented by Faber et al. [27] has been widely used to define so called FLP answer sets for different types of logic programs.  ...  This is also the first answer set semantics that is free of circular justifications for such general logic programs.  ... 
doi:10.1016/j.artint.2014.05.001 fatcat:4uig24vdlbew3pzmbaktdtjsgy

FLP Semantics Without Circular Justifications for General Logic Programs

Yi-Dong Shen, Kewen Wang
In this paper, we address the circular justification problem for general logic programs by enhancing the FLP semantics with a level mapping formalism.  ...  The FLP semantics presented by (Faber, Leone, and Pfeifer 2004) has been widely used to define answer sets, called FLP answer sets, for different types of logic programs such as logic programs with aggregates  ...  Acknowledgments We would like to thank all anonymous reviewers for their helpful comments.  ... 
doi:10.1609/aaai.v26i1.8211 fatcat:agvm7bv2lvakhlgcxgqyx4wvw4

Evaluating epistemic negation in answer set programming

Yi-Dong Shen, Thomas Eiter
2016 Artificial Intelligence  
For illustration, we extend FLP answer set semantics of Faber et al. [8] for general logic programs with epistemic negation, leading to epistemic FLP semantics.  ...  set semantics for general logic programs by introducing a novel program transformation and a new definition of world views in which we apply epistemic negation to minimize the knowledge in world views.  ...  Acknowledgements We would like to thank the reviewers for their thoughtful and constructive comments to improve this article.  ... 
doi:10.1016/j.artint.2016.04.004 fatcat:rnuly7e3g5b2vlcdm545olzqc4

A Strongly Grounded Stable Model Semantics for Full Propositional Language [article]

Shahab Tasharrofi
2012 arXiv   pre-print
Answer set programming is one of the most praised frameworks for declarative programming in general and non-monotonic reasoning in particular.  ...  There has been many efforts to extend stable model semantics so that answer set programs can use a more extensive syntax.  ...  So, for program Π 1 , we believe that FLP semantics captures the right answer sets but that equilibrium model semantics allows non-intended answer sets.  ... 
arXiv:1211.2986v2 fatcat:6wal7eghbjbtvpjpcvyv4wolu4

Evaluating Epistemic Negation in Answer Set Programming (Extended Abstract)

Yi-Dong Shen, Thomas Eiter
2017 Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence  
existing approaches behave not satisfactorily in that they suffer from the problems of unintended world views due to recursion through the epistemic modal operator K or M ( K F and M F are shorthands for  ...  In this paper we present a general approach to epistemic negation which is free of unintended world views and thus offers a solution to the long-standing problem of epistemic specifications which were  ...  Acknowledgments This work is supported in part by China National 973 program 2014CB340301 and NSFC grant 61379043, and the Austrian Science Fund (FWF) via the projects P24090 and P27730.  ... 
doi:10.24963/ijcai.2017/722 dblp:conf/ijcai/ShenE17 fatcat:vr6hppwfqfeshjirtkc6nhstmm

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

Yi-Dong Shen, Kewen Wang
2011 Lecture Notes in Computer Science  
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  ...  We show that the answer set semantics for normal DL logic programs is decidable if the underlying description logic is decidable (e.g. SHOIN or SROIQ).  ...  We would like to thank all anonymous reviewers for their helpful comments.  ... 
doi:10.1007/978-3-642-25073-6_40 fatcat:2gpgy7qa7zfzzgtdw43niqopju

The loop formula based semantics of description logic programs

Yisong Wang, Jia-Huai You, Li Yan Yuan, Yi-Dong Shen, Mingyi Zhang
2012 Theoretical Computer Science  
We also compare the canonical answer set semantics with the FLP-answer set semantics [9] for dl-programs and reveal that the former excludes certain circular justification of the latter, i.e., canonical  ...  answer sets are FLP-answer sets, but not vice versa in general.  ...  Acknowledgements We thank the reviewers for their detailed comments, which helped improve the presentation of this paper.  ... 
doi:10.1016/j.tcs.2011.10.026 fatcat:jb2iszgtzzfcldqmbgzs6quc7i

Well-Supported Semantics for Logic Programs with Generalized Rules [chapter]

Jia-Huai You, Yi-Dong Shen, Kewen Wang
2012 Lecture Notes in Computer Science  
Finally, we show that previously proposed well-supported semantics for aggregate programs and description logic programs are rooted in the justified stable semantics of general programs.  ...  A question of interest is how to characterize the property of well-supportedness, in the sense of Fages, which has been considered a cornerstone in answer set programming.  ...  For normal programs, the notion of well-supportedness is well understood [11] , which can be informally described as non-circular justification of atoms in answer sets.  ... 
doi:10.1007/978-3-642-30743-0_39 fatcat:vhg5zu27qzhrlbgquhpm3roj7e

Determining Inference Semantics for Disjunctive Logic Programs

Yi-Dong Shen, Thomas Eiter
2019 Artificial Intelligence  
the complexity of brave and cautious reasoning increases under DI-semantics by one level of the polynomial hierarchy, which thus offers higher problem solving capacity.  ...  Acknowledgement We thank the Associate Editor and anonymous reviewers for their valuable comments on a draft of this article, which helped to improve its quality a lot.  ...  To solve the problem of circular justifications with the answer set semantics for general normal programs such as those defined in [55, 69, 6, 24, 27] , Shen et al.  ... 
doi:10.1016/j.artint.2019.103165 fatcat:x7xt72vuajcxdnjov55a33rilq

Embedding Description Logic Programs into Default Logic [article]

Yisong Wang and Jia-Huai You and Li Yan Yuan and Yi-Dong Shen and Thomas Eiter
2011 arXiv   pre-print
Description logic programs (dl-programs) under the answer set semantics formulated by Eiter et al. have been considered as a prominent formalism for integrating rules and ontology knowledge bases.  ...  In addition, our default logic encoding can be extended in a simple way to capture recently proposed weakly well-supported answer set semantics, for arbitrary dl-programs.  ...  Under the well-supported semantics To avoid circular justifications in some weak and strong answer sets of dl-programs, recently wellsupported semantics for dl-programs was proposed (Shen, 2011) .  ... 
arXiv:1111.1486v1 fatcat:2q7d326dhfckjc5znnu5ivf2si

Efficient HEX-Program Evaluation Based on Unfounded Sets

T. Eiter, M. Fink, T. Krennwallner, C. Redl, P. Schüller
2014 The Journal of Artificial Intelligence Research  
HEX-programs extend logic programs under the answer set semantics with external computations through external atoms.  ...  To this end, we present an approach based on unfounded sets as a generalization of related techniques for ASP programs.  ...  Fink, Krennwallner, Redl, & Schüller, 2012c) , and the 5th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2012), September 4, 2012, Budapest, Hungary (Eiter, Fink, Krennwallner  ... 
doi:10.1613/jair.4175 fatcat:hcxe3ullanbztaafzxk6g6ekie

Stepwise debugging of answer-set programs

2017 Theory and Practice of Logic Programming  
We introduce a stepping methodology for answer-set programming (ASP) that allows for debugging answer-set programs and is based on the stepwise application of rules.  ...  As a solid formal basis for stepping, we develop a framework of computations for answer-set programs.  ...  Acknowledgements We thank the reviewers for their useful comments.  ... 
doi:10.1017/s1471068417000217 fatcat:pwi4pk775fflnn6kkq3g6pdhyq

Stepwise Debugging of Answer-Set Programs [article]

Johannes Oetsch, Jörg Pührer, Hans Tompits
2017 arXiv   pre-print
We introduce a stepping methodology for answer-set programming (ASP) that allows for debugging answer-set programs and is based on the stepwise application of rules.  ...  As a solid formal basis for stepping, we develop a framework of computations for answer-set programs.  ...  Acknowledgements We thank the reviewers for their useful comments.  ... 
arXiv:1705.06564v1 fatcat:qea4blojk5dgtoxlgtdblyaym4

Logic programming with constraints

Guohua Liu
Answer set programming (ASP), namely logic programming under the answer set semantics, provides a promising constraint programming paradigm, due to its simple syntax, high expressiveness, and effective  ...  Logic programs with these constraints are referred to as weight constraint, aggregate and abstract constraint programs.  ...  SMODELS and CLASP ) without generating circular models.  ... 
doi:10.7939/r37k5s fatcat:djqnhojyujclfppvy5uyatrybi

LIPIcs, Volume 7, ICLP'10, Complete Volume [article]

Manuel Hermenegildo, Torsten Schaub
PROGRAM ANALYSIS FOR CODE DUPLICATION IN LOGIC PROGRAMS Acknowledgements This PhD research is under the supervision of Professor Wim Vanhoof.  ...  Hence, researchers can use our system without downloading or installation of any program or ASP solver.  ...  Introduction The stable model semantics [Gel88] of logic programs, also known as the answer set semantics, constitutes the semantical cornerstone of answer set programming (ASP).  ... 
doi:10.4230/lipics.iclp.2010 fatcat:j7jd7dpsffbs7plm5qa6qi2wem
« Previous Showing results 1 — 15 out of 23 results