Semantical considerations on nonmonotonic logic
Artificial Intelligence
Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Journal of the ACM (JACM)
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Disjunctive stable models: unfounded sets, fixpoint semantics, and computation
Information and Computation
Nonmonotonic Logic II: Nonmonotonic Modal Theories
Journal of the ACM (JACM)
A survey of paraconsistent semantics for logic programs
Handbook of defeasible reasoning and uncertainty management systems
Combining fuzzy information: an overview
ACM SIGMOD Record
Fixpoint semantics for logic programming a survey
Theoretical Computer Science
Paraconsistent Declarative Semantics for Extended Logic Programs
Annals of Mathematics and Artificial Intelligence
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Incremental recomputation in local languages
Information and Computation
RankSQL: query algebra and optimization for relational top-k queries
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Any-world assumptions in logic programming
Theoretical Computer Science
Epistemic foundation of stable model semantics
Theory and Practice of Logic Programming
Query answering in normal logic programs under uncertainty
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
A top-k query answering procedure for fuzzy logic programming
Fuzzy Sets and Systems
| Hi-index | 0.00 |
The Any-World Assumption (AWA) has been introduced for normal logic programs as a generalization of the well-known notions of Closed World Assumption (CWA) and the Open World Assumption (OWA). The AWA allows anyassignment (i.e., interpretation), over a truth space(bilattice), to be a default assumption and, thus, the CWA and OWA are just special cases. To answer queries, we provide a novel and simple top-down procedure.