The following pages link to Eric Martin (Q169436):
Displaying 50 items.
- Announcements to attentive agents (Q302225) (← links)
- The undecidability of quantified announcements (Q310079) (← links)
- Fuzzy knowledge management for the semantic web (Q362343) (← links)
- Learning and classifying (Q390916) (← links)
- The logic of justified belief, explicit knowledge, and conclusive evidence (Q392273) (← links)
- Algebraic semantics and model completeness for intuitionistic public announcement logic (Q393906) (← links)
- Completeness results for memory logics (Q408552) (← links)
- Inductivism and Parmenidean epistemology: Kyburg's way (Q432961) (← links)
- Learning with ordinal-bounded memory from positive data (Q440010) (← links)
- Intricate axioms as interaction axioms (Q497427) (← links)
- Linear logic as a tool for planning under temporal uncertainty (Q534715) (← links)
- Conditional probability in the light of qualitative belief change (Q535329) (← links)
- Structural correspondence between theories and convergence to truth (Q542129) (← links)
- A structuralist theory of belief revision (Q548705) (← links)
- (Q590741) (redirect page) (← links)
- The situation calculus: a case for modal logic (Q616039) (← links)
- Input-dependence in function-learning (Q733744) (← links)
- Unifying logic, topology and learning in parametric logic (Q817837) (← links)
- On ordinal VC-dimension and some notions of complexity (Q860824) (← links)
- Logic programming as classical inference (Q898781) (← links)
- Absolute versus probabilistic classification in a logical setting (Q924172) (← links)
- An internal version of epistemic logic (Q965903) (← links)
- Group announcement logic (Q975877) (← links)
- Justification logics, logics of knowledge, and conservativity (Q1028642) (← links)
- Multi-modal CTL: completeness, complexity, and an application (Q1037587) (← links)
- On the scalability of description logic instance retrieval (Q1040773) (← links)
- Deciding inseparability and conservative extensions in the description logic (Q1041590) (← links)
- Belief revision in the service of scientific discovery (Q1296384) (← links)
- Generalized logical consequence: Making room for induction in the logic of science (Q1610619) (← links)
- Induction by enumeration (Q1854469) (← links)
- Learning power and language expressiveness. (Q1874277) (← links)
- A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs (Q1926591) (← links)
- A dynamic logic of agency. II: Deterministic \({\mathcal{DLA}}\), coalition logic, and game theory (Q1959225) (← links)
- Choice revision (Q2008635) (← links)
- Truth-tracking by belief revision (Q2009768) (← links)
- Nonmonotonicity in the framework of parametric logic (Q2009771) (← links)
- Freedom and enforcement in action. A study in formal action theory (Q2018240) (← links)
- Logics for computer and data sciences, and artificial intelligence (Q2057567) (← links)
- Normal forms of conditional knowledge bases respecting system P-entailments and signature renamings (Q2075376) (← links)
- A dynamic logic of agency. I: STIT, capabilities and powers (Q2268355) (← links)
- Modal provability foundations for argumentation networks (Q2269511) (← links)
- A logical account of formal argumentation (Q2269515) (← links)
- Fast-collapsing theories (Q2350213) (← links)
- Deciding unifiability and computing local unifiers in the description logic \(\mathcal{EL}\) without top constructor (Q2374390) (← links)
- On the data consumption benefits of accepting increased uncertainty (Q2381574) (← links)
- Observational calculi and association rules (Q2392092) (← links)
- Neighborhood semantics for modal logic (Q2399881) (← links)
- Synthesis of positive logic programs for checking a class of definitions with infinite quantification (Q2629858) (← links)
- Robust learning of automatic classes of languages (Q2637647) (← links)
- Robust Learning of Automatic Classes of Languages (Q3093939) (← links)
