Our current understanding about the AS level topology of the Internet is based on measurements and inductive-type models which set up rules describing the behavior (node and edge dynamics) of the individual ASes and generalize the consequences of these individual actions for the complete AS ecosystem using induction. In this paper we suggest a third, deductive approach in which we have premises...

In three case studies on notions of fuzzy logic and fuzzy set theory (Dubois–Prade’s gradual elements, the entropy of a fuzzy set, and aggregation operators), the paper exemplifies methodological differences between traditional and deductive fuzzy logic. While traditional fuzzy logic admits various interpretations of membership degrees, deductive fuzzy logic always interprets them as degrees of...

Modern fact databases contain abundant data classified through several classifications. Typically users must consult these classifications in separate manuals or files thus making their effective use difficult. Contemporary database systems do little to support deductive use of classifications. In this paper we show how deductive data management techniques can be applied to the utilization of d...

This article begins with an account of logic, and of how logicians formulate formal rules of inference for the sentential calculus, which hinges on analogs of negation and the connectives if, or, and and. It considers the various ways in which computer scientists have written programs to prove the validity of inferences in this and other domains. Finally, it outlines the principal psychological...

We present several results concerning deductive completeness of the simply typed λcalculus with constants and equational axioms. First, we prove deductive completeness of the calculus with respect to standard semantics for axioms containing neither free nor bound occurrences of higher-order variables. Using this result, we analyze some fundamental deductive and semantic properties of axiomatic ...

We propose a method for integrity checking in the context of temporal deductive databases. A temporal deductive database is a deductive database that supports some aspect of time, in our case valid time, in which valid time is the time when the fact is true in the modelled reality. Our method augments a database with a set of transition and event rules, which explicitly define the insertions an...

This paper introduces and studies a declarative framework for updating views over indefinite databases. An indefinite database is a database with null values that are represented, following the standard database approach, by a single null constant. The paper formalizes views over such databases as indefinite deductive databases, and defines for them several classes of database repairs that real...

We exploit the spreadsheet metaphor to make deductive problem-solving methods available to the vast population of spreadsheet end users. In particular, we show how the function-based problem-solving capabilities of spreadsheets can be extended to include logical deductive methods in a way that is consistent with the existing spreadsheet “look and feel.” The foundation of our approach is the int...

In this paper, we address one important aspect of the problem of designing a cooperative deductive database system, namely, allocation of rules across the deductive database systems. We identify communication cost as the primary consideration in allocation of rules. The problem of optimal allocation of rules has been shown NP-complete, which has prohibitive execution times for large knowledge b...