Foundations of information and knowledge systems

More about the book

The book features a diverse range of topics, including invited talks and regular papers that explore various aspects of software product lines, geometric identification, and agent strategies. It discusses the aggregation of attack relations through a social-choice theoretical lens, alternative characterizations for program equivalence under answer-set semantics, and a new foundation for Defeasible Logic Programming. The content also addresses reasoning about data dependencies in fixed and undetermined universes, presenting autonomous sets for hypergraph decomposition relevant to database theory. Strategies for cost-minimizing data labeling, optimal stopping, and active learning are examined, along with reflections of view updates on relational database schemata and the merging of first-order knowledge using dilation operators. The existence of Armstrong instances with bounded domains and reasoning on data models during schema translation are also covered. Further, the book delves into tightly integrated probabilistic description logic programs for ontology mappings, the use of transversals for XML functional dependencies, and visibly pushdown transducers for streaming XML validation. Additionally, it presents a probabilistic logic with polynomial weight formulas, transformation-based view updating in deductive databases, effective argumentation algorithms, database preference queries in a possibilistic logic framework, and exp