This paper presents a semi-formal denotational definition of the semantics of a version of domain relational calculus called DRC. A single basic design principle governs the semantic definition: each predicate (or formula) of DRC denotes a relation. The definition obtained is precise, short, and systematic. Generalizations of operations of the relational algebra are suggested, which correspond ...

While there is a generic agreement that formal semantic specifications could resolve ambiguities in modeling languages, in practice, languages are often developed without such unambiguous specifications. In this paper, I propose a logic-based infrastructure for the specification of Domain-Specific Modeling Languages (DSML). The key advantage of the approach is the executability of the specifica...

We address the problem of representing commonsense knowledge about action domains in the formalisms of logic programming and default logic. We employ a methodology proposed by Gelfond and Lifschitz which involves rst deening a high-level language for representing knowledge about actions , and then specifying a translation from the high-level action language into a general-purpose formalism, suc...

In this note we show how any formula δ with a proof of super-polynomial size in M→ has a poly-sized proof in K→ . This fact entails that any propositional classical tautology has short proofs, i.e., NP=CoNP. 1 Every classical tautology has short proofs This article reports the results on the investigation on the existence of short proofs for every Classical Propositional Logic tautology. Firstl...

Function discovery is the problem of nding a symbolic formula for a function f : D1!D2 from a set of examples f(x; y) j y = f(x)g D1 D2. Acceptable solutions are restricted to formulas expressible in some given description language L. In most previous discovery systems|for example, Bacon [4], Abacus [1], Coper [2], Fahrenheit [3] and IDS [5]|the description language is restricted to contain onl...

The process of documenting designs is tedious and often error prone We discuss a system that automatically generates documentation for the single step transition behavior of Statecharts with particular focus on the correctness of the result in the sense that the document will present all and only the facts corresponding to the design being documented Our approach is to translate the Statechart ...

The following problem arose in connection with our research in statistical group theory: estimate a, := the number of partitions of n into parts that are pairwise relatively prime. This differs from most problems in the theory of partitions because of the complicated relationship between the part sixes. We obtain an asymptotic formula for log a,, but leave open the challenging task of obtaining...