|Author||Marek, Wiktor ♦ Truszczyski, Mirosaw|
|Source||ACM Digital Library|
|Publisher||Association for Computing Machinery (ACM)|
|Subject Domain (in DDC)||Computer science, information & general works ♦ Data processing & computer science|
|Abstract||Autoepistemic logic is one of the principal modes of nonmonotonicreasoning. It unifies several other modes of nonmonotonic reasoning andhas important application in logic programming. In the paper, a theoryof autoepistemic logic is developed. This paper starts with a briefsurvey of some of the previously known results. Then, the nature ofnonmonotonicity is studied by investigating how membership ofautoepistemic statements in autoepistemic theories depends on theunderlying objective theory. A notion similar to set-theoretic forcingis introduced. Expansions of autoepistemic theories are alsoinvestigated. Expansions serve as sets of consequences of anautoepistemic theory and they can also be used to define semantics forlogic programs with negation. Theories that have expansions arecharacterized, and a normal form that allows the description of allexpansions of a theory is introduced. Our results imply algorithms todetermine whether a theory has a unique expansion. Sufficient conditions(stratification) that imply existence of a unique expansion arediscussed. The definition of stratified theories is extended and (undersome additional assumptions) efficient algorithms for testing whether atheory is stratified are proposed. The theorem characterizing expansionsis applied to two classes of theories, K1-theoriesand ae-programs. In each case, simple hypergraph characterization ofexpansions of theories from each of these classes is given. Finally,connections with stable model semantics for logic programs with negationis discussed. In particular, it is proven that the problem of existenceof stable models is NP-complete.—<?Pub Fmt italic><?Pub Caret>Authors' Abstract<?Pub Fmt /italic>|
|Age Range||18 to 22 years ♦ above 22 year|
|Education Level||UG and PG|
|Learning Resource Type||Article|
|Publisher Place||New York|
|Journal||Journal of the ACM (JACM)|
Ministry of Human Resource Development (MHRD) under its National Mission on Education through Information and Communication Technology (NMEICT) has initiated the National Digital Library of India (NDLI) project to develop a framework of virtual repository of learning resources with a single-window search facility. Filtered and federated searching is employed to facilitate focused searching so that learners can find out the right resource with least effort and in minimum time. NDLI is designed to hold content of any language and provides interface support for leading vernacular languages, (currently Hindi, Bengali and several other languages are available). It is designed to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is being developed to help students to prepare for entrance and competitive examinations, to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is being developed at Indian Institute of Technology Kharagpur.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Human Resource Development (MHRD), through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
For any issue or feedback, please write to email@example.com