- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Grounded fixpoints and their applications in knowledge representation
Artificial Intelligence 224 (C):51-71 (2015)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Safe inductions and their applications in knowledge representation.Bart Bogaerts, Joost Vennekens & Marc Denecker - 2018 - Artificial Intelligence 259 (C):167-185.
PRICAI 2021: Trends in Artificial Intelligence.Nghia Pham Duc, Theeramunkong Thanaruk, Governatori Guido & Fenrong Liu (eds.) - 2021 - Springer.
Representation= grounded information.Mary-Anne Williams - 2008 - In Tu-Bao Ho & Zhi-Hua Zhou, PRICAI 2008: Trends in Artificial Intelligence. Springer. pp. 473--484.
Computational Intelligence: A Logical Approach.David Poole, Alan Mackworth & Randy Goebel - 1998 - Oxford University Press.
The representation of context: Ideas from artificial intelligence.James Franklin - 2003 - Law, Probability and Risk 2:191-199.
Knowledge forgetting: Properties and applications.Yan Zhang & Yi Zhou - 2009 - Artificial Intelligence 173 (16-17):1525-1537.
Applications of Circumscription to Formalizing Common Sense Knowledge.John McCarthy - 1986 - Artificial Intelligence 28 (1):89–116.
Processi di rappresentazione, soggetto e società.Federico Braga Illa (ed.) - 1999 - Urbino: Quattroventi.
Knowledge Representation and Logic Programming.Michael Gelfond & Nicola Leone - 2002 - Artificial Intelligence 138 (1-2):1.
Existence assumptions in knowledge representation.Graeme Hirst - 1991 - Artificial Intelligence 49 (1-3):199-242.
Analytics
Added to PP
2020-12-22
Downloads
38 (#1,418,507)
6 months
6 (#1,537,359)
2020-12-22
Downloads
38 (#1,418,507)
6 months
6 (#1,537,359)
Historical graph of downloads
Citations of this work
Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory.Hannes Strass & Johannes Peter Wallner - 2015 - Artificial Intelligence 226 (C):34-74.
Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming.Jesse Heyninck, Ofer Arieli & Bart Bogaerts - 2024 - Artificial Intelligence 331 (C):104110.
Fixpoint semantics for active integrity constraints.Bart Bogaerts & Luís Cruz-Filipe - 2018 - Artificial Intelligence 255 (C):43-70.
Safe inductions and their applications in knowledge representation.Bart Bogaerts, Joost Vennekens & Marc Denecker - 2018 - Artificial Intelligence 259 (C):167-185.
Fixed point semantics for stream reasoning.Christian Antić - 2020 - Artificial Intelligence 288 (C):103370.
References found in this work
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games.Phan Minh Dung - 1995 - Artificial Intelligence 77 (2):321-357.
Semantic Considerations on nonmonotonic Logic.Robert C. Moore - 1985 - Artificial Intelligence 25 (1):75-94.
Try MATCHA Writer if you're interested in citing directly from PhilPapers and certifying your authorship.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation