Translating Advanced Integrity Checking Technology to SQL

Jon Barwise and John Etchemendy, The language of first-order logic, including the IBM-compatible Windows version of Tarski's world 4.0. Third edition of LVIII 362. CSLI lecture notes.no. 34. Center for the Study of Language and Information, Stanford 1992. also distributed by Cambridge University Press, New York, xiv + 319 pp. + disk. - Volume 64 Issue 2

Active Logic is a conceptual system, the principles of which are satisfied with formalisms of reasoning, which allow correlating the results of reasoning with moments in time and ensuring tolerance to contradictions. At present, tolerance to contradictions (paraconsistency) as applied to Active Logic systems has received theoretical justification in the works of the authors of this report and refers to the so-called formalisms of step theories, combining the principles of Active Logic and logical programming. In particular, it was proved that the argumentative semantics of the formalism of extended step theories, which have two types of negation and have more developed expressive capabilities, are paranormal. The formalism introduced in this paper has even greater expressive capabilities. Keeping all the controls for the process of reasoning in time, this formalism allows one to more adequately represent facts about the subject area by using the language of first-order logic instead of the language of propositional logic. For the formalism of extended step theories of the first order, a declarative semantics is proposed, its paraneosistance is shown, and the expressive possibilities of this formalism in relation to the tasks of action planning are demonstrated using the example of the monkey and the banana.KeywordsActive logicTime reasoningExtended first-order step theoriesDeclarative semanticsParaconsistencyArgumentative semantics

We show that stable models of logic programs may be viewed as minimal models of programs that satisfy certain additional constraints. To do so, we transform the normal programs into disjunctive logic programs and sets of integrity constraints. We show that the stable models of the normal program coincide with the minimal models of the disjunctive program thatsatisfy the integrity constraints. As a consequence, the stable model semantics can be characterized using theextended generalized closed world assumption for disjunctive logic programs. Using this result, we develop a bottomup algorithm for function-free logic programs to find all stable models of a normal program by computing the perfect models of a disjunctive stratified logic program and checking them for consistency with the integrity constraints. The integrity constraints provide a rationale as to why some normal logic programs have no stable models.

The query of database must rely on professional query language, which is difficult to grasp for ordinary users. Natural language query interface (NLQI) can be applied to solve this problem with better human-computer interaction and intelligence. However, current natural language understanding technology is not mature. Though the query sentences’ structure is fixed, it is also difficult to accurately convert query sentences into understandable database query language for computer. Therefore a method of designing NLQI based on syntax and semantic analysis is proposed in this paper. First of all, Maximum forward and maximum reverse matching algorithms are used to analyse sentence by part of speech (POS) template, which is able to demonstrate the syntax relationship among the words. After syntax analysis, query conditions and targets are identified. Then, single conditions and targets are analyzed to relative standard forms by the relationship among entity, property, connect verb and unit. At last, these standard forms are transformed to SQL sentence. Regarding printing ERP system as experimental subject, experiment is done in this paper. The result shows that the method proposed in this paper can meet the needs of natural language query, and has a good transform effect for combination, omitting and other complex sentences.

Robert van Rooij (2006) proposed an analysis of counterfactual donkey sentences by combining the Stalnaker–Lewis analysis of counterfactuals with standard dynamic semantics. This paper points out some problems with van Rooij's treatment of counterfactual sentences in the language of first-order logic and provides a new interpretation using dynamic semantics.

We now turn to the study of self-reference in arithmetic couched in the language of first-order logic. For this chapter and Chapter 9, a prior acquaintance with the logical connectives and quantifiers, though not strictly necessary, is certainly desirable. Part I of this chapter is necessary for the incompleteness proof of Peano Arithmetic given in Chapter 9. The remaining parts of this chapter are not needed for any of the subsequent chapters, but should be of interest to those who wish to see some new and unusual methods of achieving self-reference in arithmetic, as well as a generalization that also generalizes Cantor’s famous proof that a set cannot be put into a 1–1 correspondence with its power set.

Typically, object-oriented schemas are lacking declarative specification of the schema integrity constraints. Object-oriented transactions are also typically missing a fundamental ACID requirement: consistency. We present a developed technology based on object-oriented assertion languages that overcomes these limitations of persistent and database object systems. This technology allows specification of objectoriented integrity constraints, their static verification and dynamic enforcement. Proof strategies that are based on static and dynamic verification techniques as they apply to verification of object-oriented transactions are presented in the paper. Most of this work has been motivated by the problems of object-oriented interfaces to XML that have not been able to express typical XML Schema constraints, database constraints in particular. The components of this technology are an object-oriented constraint language, a verification system with advanced typing and logic capabilities, predefined libraries of object-oriented specification and verification theories, and an extended virtual platform for integrating constraints into the run-time type system and their management.

This paper describes two approaches to the automatic generation of behavioral VHDL models from descriptions written in natural language. Both approaches are based on a modeling style in which behavior is represented by a system of interconnected processes. The first approach employs a semantic grammar to directly generate a single VHDL process from a paragraph written in a restricted English called ModelSpeak. The second approach accepts more general English and generates models consisting of multiple processes. series of sentences describing the behavior of a single process and generated correct VHDL code for it. This interface requires the behavior be expressed in a highly restricted English called ModelSpeak (10). Conditional expressions (if statements) may be nested to two levels, and interaction is invoked by the interface to resolve scope ambiguity of loops. This interface is implemented with a semantic grammar (3) in Prolog. The second interface (Approach II) to the Modeler's Assistant for natural language is substantially more complex, but accepts more general English expressions and generates multiple-process models. In this approach, each sentence is parsed by a bottom-up, parallel chart parser to generate a set of valid parse trees. The trees are examined by a Semantic Analyzer (7) to determine one which is semantically correct, and a conceptual graph (14) (semantic network) of its meaning is generated. Once the conceptual graph of individual sentences are joined together (12), a program called the Linker (8) analyzes the graph to produce a Process Model Graph and VHDL process code for the Modeler's Assistant. Nodes in the conceptual graph representing verbs typically generate processes or the conditions which govern them. Nodes representing objects generate signals. The modeling style underlying the Linker produces a sizable collection of processes, each consisting of a single if_then statement. To avoid unnecessary bus resolutions, multiple processes assigning to the same signal are merged. Since signal types are generally not expressed in the English description, they may be added interactively later. Before describing the approaches in more detail, related research on natural language interfaces is reviewed briefly.

CUCS-231-86 Programs interacting with users via natural language interfaces generally require more sophisticated control structures than those needed by programs interacting with users through less flexible mechanisms. This paper describes our development of Director, an interpreter (inference engine) for rule-based programs. Providing an efficient combination of forward and backward chaining, heuristic and user control of inference, and ready access to portions of its internal sttucrure, Director facilitates the construction of systems with natural language interfaces as well as other rule-based systems in which queries are expensive. This research was partially supported by Office of Naval Research grant NOOO 14-82-K-0256. Director An Interpreter for Rule-based Programs

Structured Query Language (SQL) is commonly used in Relational Database Management Systems (RDBMS) and is currently one of the most popular data definition and manipulation languages. Its core functionality is implemented, with only some minor variations, throughout all RDBMS products. It is an effective tool in the process of managing and querying data in relational databases. This paper describes a method to effectively automate the conversion of a data query from a Natural Language Query (NLQ) to Structured Query Language (SQL) with Online Analytical Processing (OLAP) cube data warehouse objects. To obtain or manipulate the data from relational databases, the user must be familiar with SQL and must also write an appropriate and valid SQL statement. However, users who are not familiar with SQL are unable to obtain relevant data through relational databases. To address this, we propose a Natural Language Processing (NLP) model to convert an NLQ into an SQL query. This allows novice users to obtain the required data without having to know any complicated SQL details. The model is also capable of handling complex queries using the OLAP cube technique, which allows data to be pre-calculated and stored in a multi-dimensional and ready-to-use format. A multi-dimensional cube (hypercube) is used to connect with the NLP interface, thereby eliminating long-running data queries and enabling self-service business intelligence. The study demonstrated how the use of hypercube technology helps to increase the system response speed and the ability to process very complex query sentences. The system achieved impressive performance in terms of NLP and the accuracy of generating different query sentences. Using OLAP hypercube technology, the study achieved distinguished results compared to previous studies in terms of the speed of the response of the model to NLQ analysis, the generation of complex SQL statements, and the dynamic display of the results. As a plan for future work, it is recommended to use infinite-dimension (n-D) cubes instead of 4-D cubes to enable ingesting as much data as possible in a single object and to facilitate the execution of query statements that may be too complex in query interfaces running in a data warehouse. The study demonstrated how the use of hypercube technology helps to increase system response speed and process very complex query sentences.

Asynchronous links that re-order samples: An L2 gain embedding

A Web-Based Perioperative Dashboard as a Platform for Anesthesia Informatics Innovation.

This paper intends to classify, review, and compare the existing languages for the specification of spatial integrity constraints at the conceptual level. We classify these languages into natural, visual, first-order logic, and hybrid and review their syntax and semantics. We compare these language categories based on expressiveness and pragmatics qualities. The results of this study show that controlled natural languages and natural hybrid languages with pictograms are good candidates for expressing spatial integrity constraints at the conceptual level of spatial databases. At the end, we identify new research challenges that should be addressed in this domain in order to facilitate spatial integrity constraint specification and representation.

Translating Multi-Agent Autoepistemic Logic into Logic Program

A prototype inquiry dialog system, dubbed Detecticon, demonstrates its ability to handle inquiry dialogs, including presenting reasonable arguments, tracking user beliefs, and refining its arguments. User interaction is supported by using a natural language interface and a graphical user interface.