Towards Intelligent Databases

This article is a presentation of the objectives and techniques of deductive databases. The deductive approach to databases aims at extending with intensional definitions other database paradigms that describe applications extensionaUy. We first show how constructive specifications can be expressed with deduction rules, and how normative conditions can be defined using integrity constraints. We outline the principles of bottom-up and top-down query answering procedures and present the techniques used for integrity checking. We then argue that it is often desirable to manage with a database system not only database applications, but also specifications of system components. We present such meta-level specifications and discuss their advantages over conventional approaches

Para to Ortho transition of metallic dimers on Si(001)

Extensive electronic structure calculations are performed to obtain the stable geometries of metals like Al, Ga and In on the Si(001) surface at 0.5 ML and 1 ML coverages. Our results coupled with previous theoretical findings explain the recent experimental data in a comprehensive fashion. At low coverages, as shown by previous works, `Para' dimers give the lowest energy structure. With increasing coverage beyond 0.5 ML, `Ortho' dimers become part of low energy configurations leading toward a `Para' to `Ortho' transition at 1 ML coverage. For In mixed staggered dimers (`Ortho' and `Para') give the lowest energy configuration. For Ga, mixed dimers are non-staggered, while for Al `Para' to `Ortho' transition of dimers is complete. Thus at intermediate coverages between 0.5 and 1 ML, the `Ortho' and `Para' dimers may coexist on the surface. Consequently, this may be an explanation of the fact that the experimental observations can be successfully interpreted using either orientation. A supported zigzag structure at 0.5 ML, which resembles ${\rm (CH)_x}$, does not undergo a dimerization transition, and hence stays semi-metallic. Also, unlike ${\rm (CH)_x}$ the soliton formation is ruled out for this structure.Comment: 8 pages, 6 figure

Towards Closed World Reasoning in Dynamic Open Worlds (Extended Version)

The need for integration of ontologies with nonmonotonic rules has been gaining importance in a number of areas, such as the Semantic Web. A number of researchers addressed this problem by proposing a unified semantics for hybrid knowledge bases composed of both an ontology (expressed in a fragment of first-order logic) and nonmonotonic rules. These semantics have matured over the years, but only provide solutions for the static case when knowledge does not need to evolve. In this paper we take a first step towards addressing the dynamics of hybrid knowledge bases. We focus on knowledge updates and, considering the state of the art of belief update, ontology update and rule update, we show that current solutions are only partial and difficult to combine. Then we extend the existing work on ABox updates with rules, provide a semantics for such evolving hybrid knowledge bases and study its basic properties. To the best of our knowledge, this is the first time that an update operator is proposed for hybrid knowledge bases.Comment: 40 pages; an extended version of the article published in Theory and Practice of Logic Programming, 10 (4-6): 547 - 564, July. Copyright 2010 Cambridge University Pres

Prioritized Repairing and Consistent Query Answering in Relational Databases

A consistent query answer in an inconsistent database is an answer obtained in every (minimal) repair. The repairs are obtained by resolving all conflicts in all possible ways. Often, however, the user is able to provide a preference on how conflicts should be resolved. We investigate here the framework of preferred consistent query answers, in which user preferences are used to narrow down the set of repairs to a set of preferred repairs. We axiomatize desirable properties of preferred repairs. We present three different families of preferred repairs and study their mutual relationships. Finally, we investigate the complexity of preferred repairing and computing preferred consistent query answers.Comment: Accepted to the special SUM'08 issue of AMA

A formal account of dishonesty

International audienceThis paper provides formal accounts of dishonest attitudes of agents. We introduce a propositional multi-modal logic that can represent an agent's belief and intention as well as communication between agents. Using the language, we formulate different categories of dishonesty. We first provide two different definitions of lies and provide their logical properties. We then consider an incentive behind the act of lying and introduce lying with objectives. We subsequently define bullshit, withholding information and half-truths, and analyze their formal properties. We compare different categories of dishonesty in a systematic manner, and examine their connection to deception. We also propose maxims for dishonest communication that agents should ideally try to satisfy

Human Conditional Reasoning in Answer Set Programming

Given a conditional sentence "P=>Q" (if P then Q) and respective facts, four different types of inferences are observed in human reasoning. Affirming the antecedent (AA) (or modus ponens) reasons Q from P; affirming the consequent (AC) reasons P from Q; denying the antecedent (DA) reasons -Q from -P; and denying the consequent (DC) (or modus tollens) reasons -P from -Q. Among them, AA and DC are logically valid, while AC and DA are logically invalid and often called logical fallacies. Nevertheless, humans often perform AC or DA as pragmatic inference in daily life. In this paper, we realize AC, DA and DC inferences in answer set programming. Eight different types of completion are introduced and their semantics are given by answer sets. We investigate formal properties and characterize human reasoning tasks in cognitive psychology. Those completions are also applied to commonsense reasoning in AI.Comment: 34 pages. Shorter version: in Proceedings of the 21st International Workshop on Non-Monotonic Reasoning (NMR-2023