Formal Semantics of Dynamic Constraints and Derivation Rules in ORM

2016 ◽  
Vol 7 (2) ◽  
pp. 31-47
Author(s):  
Herman Balsters ◽  
Terry Halpin
Keyword(s):  
Predicate Logic ◽  
Formal Semantics ◽  
Role Modeling ◽  
Single Step ◽  
State Transitions ◽  
Dynamic Constraints ◽  
First Order ◽  
Previous State ◽  
Object Role Modeling ◽  
Post Condition

This paper provides formal semantics for an extension of the Object-Role Modeling approach to support declaration of dynamic rules. Dynamic rules differ from static rules by involving state transitions, rather than simply individual states. This paper restricts application of dynamic rules to single-step transactions, with a previous state (input to the transaction) and a new state (the result of that transaction). These dynamic rules specify an elementary transaction type by indicating which kinds of objects or facts (being added, deleted or updated) are involved. Dynamic rules may declare pre-conditions relevant to the transaction, and a post-condition stating the properties of the new state. In this paper the authors provide such dynamic rules with a formal semantics based on sorted, first-order predicate logic. The key idea underlying their solution is the formalization of dynamic constraints in terms of static constraints on the database transaction history.

Formal Semantics

2009 ◽  
Author(s):  
Jeffrey C. King
Keyword(s):  
Programming Languages ◽  
Predicate Logic ◽  
Formal Semantics ◽  
Linguistic Meaning ◽  
Symbolic Logic ◽  
Natural Languages ◽  
First Order ◽  
Artificial Languages ◽  
Naturally Occurring ◽  
Theories Of Meaning

Semantics is the discipline that studies linguistic meaning generally, and the qualification ‘formal’ indicates something about the sorts of techniques used in investigating linguistic meaning. More specifically, formal semantics is the discipline that employs techniques from symbolic logic, mathematics, and mathematical logic to produce precisely characterized theories of meaning for natural languages (i.e. naturally occurring languages such as English, Urdu, etc.) or artificial languages (i.e. first-order predicate logic, computer programming languages etc.). Formal semantics as we know it first arose in the twentieth century. It was made possible by certain developments in logic during that period. This article chronicles those developments and how they led to the development of formal semantics.

Syllogism and quantification

1962 ◽  
Vol 27 (1) ◽  
pp. 58-72 ◽  
Author(s):  
Timothy Smiley
Keyword(s):  
Predicate Logic ◽  
Modern Logic ◽  
First Order ◽  
First Order Predicate Logic

Anyone who reads Aristotle, knowing something about modern logic and nothing about its history, must ask himself why the syllogistic cannot be translated as it stands into the logic of quantification. It is now more than twenty years since the invention of the requisite framework, the logic of many-sorted quantification.In the familiar first-order predicate logic generality is expressed by means of variables and quantifiers, and each interpretation of the system is based upon the choice of some class over which the variables may range, the only restriction placed on this ‘domain of individuals’ being that it should not be empty.

Some logical and syntactical observations concerning the first-order dependent type system λP

1999 ◽  
Vol 9 (4) ◽  
pp. 335-359 ◽  
Author(s):  
HERMAN GEUVERS ◽  
ERIK BARENDSEN
Keyword(s):  
Predicate Logic ◽  
Type System ◽  
Logical Framework ◽  
First Order ◽  
Logical Derivation ◽  
Dependent Type ◽  
First Order Predicate Logic

We look at two different ways of interpreting logic in the dependent type system λP. The first is by a direct formulas-as-types interpretation à la Howard where the logical derivation rules are mapped to derivation rules in the type system. The second is by viewing λP as a Logical Framework, following Harper et al. (1987) and Harper et al. (1993). The type system is then used as the meta-language in which various logics can be coded.We give a (brief) overview of known (syntactical) results about λP. Then we discuss two issues in some more detail. The first is the completeness of the formulas-as-types embedding of minimal first-order predicate logic into λP. This is a remarkably complicated issue, a first proof of which appeared in Geuvers (1993), following ideas in Barendsen and Geuvers (1989) and Swaen (1989). The second issue is the minimality of λP as a logical framework. We will show that some of the rules are actually superfluous (even though they contribute nicely to the generality of the presentation of λP).At the same time we will attempt to provide a gentle introduction to λP and its various aspects and we will try to use little inside knowledge.

A Comparative Study of Numerical Techniques for Nonequilibrium Method of Characteristics

1992 ◽  
Author(s):  
T. Gary Yip ◽  
David M. Crook ◽  
Timothy P. Buell
Keyword(s):  
Method Of Characteristics ◽  
Solution Process ◽  
Initial Pressure ◽  
Single Step ◽  
Supersonic Combustion ◽  
Duct Flow ◽  
Unit Process ◽  
First Order ◽  
Constant Area ◽  
Fifth Order

Abstract Three techniques which employ different approaches for obtaining a method of characteristics solution for chemical non-equilibrium flows are reviewed and compared. Two features of the solution process are evaluated to determine their effect on the accuracy of the solution. The first aspect to be considered is the integration of the stiff conservation equations in a unit process. A new fifth-order accurate, multi-step integration routine is contrasted with a first-order accurate, single-step forward differencing scheme. The second comparison is designed to determine if a solution of the flowfield along continuous streamlines is superior to one along discontinuous segments of the streamlines. Tests are performed, using a chemical model describing the supersonic combustion of H2-air. Calculations of single unit processes are used to validate the techniques and to determine suitable grid sizes. Solutions for constant area duct flow show that the techniques which use the multi-step integration routine are more accurate. Results from the constant area duct test, for an initial pressure of 3.685 atm, show that a method of characteristics technique which utilizes continuous streamlines is able to converge at a grid size two orders of magnitude larger than that needed by a technique which uses discontinuous segments of streamlines.

First order predicate logic

1986 ◽  
pp. 155-183
Author(s):  
Igor Aleksander ◽  
Henri Farreny ◽  
Malik Ghallab
Keyword(s):  
Predicate Logic ◽  
First Order ◽  
First Order Predicate Logic

scholarly journals Higher-Order Illative Combinatory Logic

2013 ◽  
Vol 78 (3) ◽  
pp. 837-872 ◽  
Author(s):  
Łukasz Czajka
Keyword(s):  
Strong Consistency ◽  
Predicate Logic ◽  
Higher Order ◽  
Second Order ◽  
Model Construction ◽  
Partial Answer ◽  
Combinatory Logic ◽  
First Order ◽  
Propositional Quantifiers

AbstractWe show a model construction for a system of higher-order illative combinatory logic thus establishing its strong consistency. We also use a variant of this construction to provide a complete embedding of first-order intuitionistic predicate logic with second-order propositional quantifiers into the system of Barendregt, Bunder and Dekkers, which gives a partial answer to a question posed by these authors.

Modelling spatial reasoning systems with shape algebras and formal logic

1997 ◽  
Vol 11 (4) ◽  
pp. 273-285 ◽  
Author(s):  
Scott C. Chase
Keyword(s):  
Spatial Reasoning ◽  
Predicate Logic ◽  
Spatial Relations ◽  
Large Set ◽  
First Order ◽  
Reasoning Systems ◽  
Geometric Objects ◽  
Small Set ◽  
Definition Of ◽  
High Level

AbstractThe combination of the paradigms of shape algebras and predicate logic representations, used in a new method for describing designs, is presented. First-order predicate logic provides a natural, intuitive way of representing shapes and spatial relations in the development of complete computer systems for reasoning about designs. Shape algebraic formalisms have advantages over more traditional representations of geometric objects. Here we illustrate the definition of a large set of high-level design relations from a small set of simple structures and spatial relations, with examples from the domains of geographic information systems and architecture.

A Test of a Two-Stage Model of the Evaluation of Hypotheses from Quantified First-Order Predicate Logic in Information Use Tasks

1992 ◽  
Vol 71 (3_suppl) ◽  
pp. 1091-1104 ◽  
Author(s):  
Peter E. Langford ◽  
Robert Hunting
Keyword(s):  
Predicate Logic ◽  
Information Use ◽  
Stage Model ◽  
Two Stage ◽  
First Order ◽  
Alternative Hypotheses ◽  
Age Range ◽  
Hypothesis Evaluation ◽  
Universe Of Discourse ◽  
First Order Predicate Logic

480 adolescents and young adults between the ages of 12 and 29 years participated in an experiment in which they were asked to evaluate hypotheses from quantified first-order predicate logic specifying that certain classes of event were necessarily, possibly, or certainly not included within a universe of discourse. Results were used to test a two-stage model of performance on hypothesis evaluation tasks that originated in work on the evaluation of conditionals. The two-stage model, unlike others available, successfully predicted the range of patterns of reply observed. In dealing with very simple hypotheses subjects in this age range tended not to make use of alternative hypotheses unless these were explicitly or implicitly suggested to them by the task. This tells against complexity of hypothesis as an explanation of the reluctance to use alternative hypotheses in evaluating standard conditionals.

Sign in / Sign up

Export Citation Format

Share Document