A belief-base semantics for epistemic logic is defined that derives possible worlds from belief bases, enabling a compact universal epistemic model with equivalence results and a complexity bound.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2019 2verdicts
UNVERDICTED 2representative citing papers
Classes of aggregators for first-order relational databases are identified that respect integrity constraints when all inputs do, along with query languages where aggregation and querying commute.
citing papers explorer
-
Exploiting Belief Bases for Building Rich Epistemic Structures
A belief-base semantics for epistemic logic is defined that derives possible worlds from belief bases, enabling a compact universal epistemic model with equivalence results and a complexity bound.
-
Social Choice Methods for Database Aggregation
Classes of aggregators for first-order relational databases are identified that respect integrity constraints when all inputs do, along with query languages where aggregation and querying commute.