A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Knowledge base revision using circumscription
[chapter]
1993
Lecture Notes in Computer Science
Preserved Fulltext
Secondly, we de ne the revision operation by applying a form of prioritized circumscription to this representation of the knowledge base. ...
In this paper we present a framework of retrospective reasoning to deal with the belief revision problem in knowledge systems. ...
The revision operation is de ned by applying a form of circumscription to the representation of the knowledge base. ...
doi:10.1007/3-540-57530-8_29
fatcat:fje76om4ina4xi2adytu747xsm
Reducing belief revision to circumscription (and vice versa)
1997
Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper we greatly extend Winslett's work by establishing new relations between circumscription and a large number of belief revision operators. ...
Nonmonotonic formalisms and belief revision operators have been introduced as useful tools to describe and reason about evolving scenarios. ...
Dalal 's revision The same reductions between Satoh's revision and usual (set-containment-based) circumscription hold between Dalal's revision [ lo] and cardinality-based circumscription. ...
doi:10.1016/s0004-3702(97)00016-7
fatcat:dhz4yqodzfazrougv3k642nupu
Page 1660 of Mathematical Reviews Vol. , Issue 94c
[page]
1994
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The method is illustrated in a simple case: a knowledge base with a rule base modeled by implications of propositional logic, the uncertainty being measured by certainty ...
In this paper we choose circumscription as the underlying inference mechanism and use two different belief constraints to define two semantics, the stable circumscriptive semantics and the well-founded ...
Forthcoming papers
1996
Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Pearl, Uncovering trees in constraint networks This paper examines the possibility of removing redundant information from a given knowledge base and restructuring it in the form of a tree to enable efficient ...
This revised set is shown to provide the same conclusion sets on a hierarchy as path-based theories for three classical variants of preclusion. ...
Based on this transformation, our second result concerns the direct comparison of the two main GAS used today, and provides the conditions under which these two GAS are fundamentally distinct search algorithms ...
doi:10.1016/s0004-3702(96)90021-1
fatcat:pawfkp6puvbwbo4zlx5s6ftjdu
Page 8136 of Mathematical Reviews Vol. , Issue 2000k
[page]
2000
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Fuzziness Knowledge-Based Systems 7 (1999), no. 4, 363-370. ...
The revising processing is based on some kind of relation between antecedent and con- sequent, which can be a linear relation or a semantic relation. ...
Space Efficiency of Propositional Knowledge Representation Formalisms
2000
The Journal of Artificial Intelligence Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In particular, we consider formalisms for nonmonotonic reasoning, such as circumscription and default logic, as well as belief revision operators and the stable model semantics for logic programs with ...
We investigate the space efficiency of a Propositional Knowledge Representation (PKR) formalism. ...
Acknowledgments This paper is an extended and revised version of a paper by the same authors appeared in the proceedings of the fifth international conference on the principles of knowledge representation ...
doi:10.1613/jair.664
fatcat:mimtpnqjwfbzbnuycb6uv4lwqe
McCarthy variations in a modal key
2011
Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
First, we re-analyze circumscription in dynamic logics of belief change under hard and soft information. ...
Acknowledgements Several colleagues provided useful comments. ...
And in tandem with this, I would say that circumscriptive inference is about belief formation that takes place on the basis of incoming new information. 4 Clearly, knowledge update and belief revision ...
doi:10.1016/j.artint.2010.04.014
fatcat:fnjbjaj5kndvppwvtdj3lkml7m
Page 3391 of Mathematical Reviews Vol. , Issue 92f
[page]
1992
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
We propose an implementation of the belief revision formalism using truth maintenance techniques.” ...
Summary: “When new information is added to a knowledge base, the derived beliefs must be updated. ...
Page 2076 of Mathematical Reviews Vol. , Issue 98D
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
ISBN 1-57586-084-8
Publisher’s description: “Because it allows grammars to be treated as purely declarative knowledge bases, logic has long been consid- ered a suitable medium for specifying syntactic ...
After introducing the basic notions of belief revision operators and criteria of circumscription, they study some translations between them and give a general methodology to transform any belief revision ...
The Prometheus Taxonomic Model: A Practical Approach to Representing Multiple Classifications
2000
Taxon
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Using specimens as the fundamental elements of taxon circumscription also allows for the automatic naming of taxa based upon the distribution and priority of types within each circumscription, and by application ...
A selection of taxonomic database system Database systems/models using single classifications ...
of taxonomic knowledge. ...
doi:10.2307/1223932
fatcat:rvj2fk3dqnb4nerzn55g72mle4
Modeling Design Process
1990
The AI Magazine
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Acknowledgments We would like to thank Paul ten Hagen for various discussions on design process models, Kazuto Hayashi for useful discussions on logical formalization, and Juro Baba for contributions to ...
abduction on P and Ko; revision of P by deduction on Ds and Ko; and revision Ko by circumscription on Ds, P, and Ko. ...
We can avoid this contradiction by defining exceptions for these pieces of knowledge using circumscription. ...
doi:10.1609/aimag.v11i4.855
dblp:journals/aim/TakedaVTY90
fatcat:5vkueekixbbuxikgxjnfzlrs4i
Page 1071 of Mathematical Reviews Vol. , Issue 91B
[page]
1991
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
We describe a logically oriented language for representation of knowledge that allows us to formalize a relation of logical depen- dence for the lexicon of specific subject areas. ...
It is intended to be used as “a learning and reference source for students and researchers” with a knowledge of standard logic.
The book is certainly suited as a reference source. ...
Page 6326 of Mathematical Reviews Vol. , Issue 93k
[page]
1993
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
A revision, or an update, is a single formula, say p, that should be incorporated to
68 COMPUTER SCIENCE
6326
the knowledge base. This new knowledge base is denoted by T op. ...
This extension allows us to define circumscription of predicates that appear within the context of a modal operator. ...
Systematic studies in the genus Lebeckia and related genera: A revision of Lebeckia section Stiza (Crotalarieae, Fabaceae)
2007
South African Journal of Botany
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Project managers in charge of alien plant removal use various clearing methods, usually based on experience and knowledge. ...
Based on morphological evidence the genus does not appear to be a natural group. As part of an ongoing study on the generic circumscription of Lebeckia, the section Stiza was revised. ...
Project managers in charge of alien plant removal use various clearing methods, usually based on experience and knowledge. ...
doi:10.1016/j.sajb.2007.02.021
fatcat:43blvout5nekjlrhrlpfkgs66u
Opportunities and challenges presented by cryptic bryophyte species
2020
Telopea
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
species circumscription should be re-established and maintained. ...
Fully two-thirds of all studies on cryptic bryophyte species rested their claims of morphological crypsis on previous taxonomic investigations, without revision of morphology to confirm cryptic species ...
Acknowledgements I thank Jochen Heinrichs, David Glenny, Lindsey Gray, Matt von Konrat, and Trevor Wilson for useful discussions on this topic, and two reviewers and Peter Wilson for comments that improved ...
doi:10.7751/telopea14083
fatcat:4d2gmeh635fbtmndeikzjzoeum
« Previous
Showing results 1 — 15 out of 3,483 results