Approximation Schemes in Logic and Artificial Intelligence
From MaRDI portal
Publication:5505446
DOI10.1007/978-3-540-89876-4_8zbMath1203.68205OpenAlexW16072883MaRDI QIDQ5505446
Victor W. Marek, Miroslaw Truszczynski
Publication date: 27 January 2009
Published in: Transactions on Rough Sets IX (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-89876-4_8
Database theory (68P15) Logic in artificial intelligence (68T27) Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic programming (68N17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ultimate approximation and its application in nonmonotonic knowledge representation systems
- Rough sets: some extensions
- An algebraic approach to non-classical logics
- Information storage and retrieval systems: Mathematical foundations
- Uniform semantic treatment of default and autoepistemic logics
- Lattice Theory for Rough Sets
- A kripke-kleene semantics for logic programs*
- Negation in logic programming
- Rough sets
- The well-founded semantics for general logic programs
- Knowledge compilation and theory approximation
- Answer sets for consistent query answering in inconsistent databases
- Boolean Algebras with Operators. Part I
This page was built for publication: Approximation Schemes in Logic and Artificial Intelligence
