LogiQL and Predicate Logic
LogiQL is a programming language capable of computing correct answers for properly formulated problems. It has evolved from efforts to apply formal logical reasoning to databases, and this appendix describes the relationship between logic and LogiQL. In particular, the appendix describes how Log...
| Main Authors: | , |
|---|---|
| Format: | Book Section |
| Language: | English |
| Published: |
Taylor & Francis Group
2015
|
| Subjects: | |
| Online Access: | http://eprints.intimal.edu.my/338/ http://eprints.intimal.edu.my/338/1/17_ft.pdf |
| _version_ | 1848766453092712448 |
|---|---|
| author | Halpin, Terry Rugaber, Spencer |
| author_facet | Halpin, Terry Rugaber, Spencer |
| author_sort | Halpin, Terry |
| building | INTI Institutional Repository |
| collection | Online Access |
| description | LogiQL is a programming language capable of computing correct
answers for properly formulated problems. It has evolved from efforts to
apply formal logical reasoning to databases, and this appendix describes the
relationship between logic and LogiQL. In particular, the appendix describes
how LogiQL is related to propositional logic and first-order predicate logic.
Propositions are asserted by declarative sentences and are always true or
false but not both. In propositional logic, atomic propositions are denoted
by propositional constants (e.g., R = “It is raining”; S = “It is snowing”).
Compound propositions are formed by applying propositional operators
to other propositions, using parentheses if needed. For example, using ∼
for the negation operator and ∧ for the conjunction operator, we could use
the formula ∼(R∧S) to denote the proposition that “It is not both raining
and snowing.” Results about propositional patterns are indicated by using
propositional variables (e.g., p, q) to stand for any propositions in general.
For example, ∼∼p is equivalent to p regardless of which proposition is substituted
for p.
First-order logic (FOL), also called first-order predicate logic, predicate
calculus,
or quantification theory, extends propositional logic with predicates,
quantifiers, and individual constants. In logic, an individual is any individual
object (entity or value). For a given universe of discourse, specific individuals
are denoted by individual constants (e.g., terry), and specific predicates
are denoted by predicate constants with their arguments in parentheses, for
example, isTallerThan(terry,norma). General results may be stated
using individual variables (to range over any individual) and quantifiers.
The universal quantifier ∀ means “for each” or “for all.” |
| first_indexed | 2025-11-14T11:51:23Z |
| format | Book Section |
| id | intimal-338 |
| institution | INTI International University |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-14T11:51:23Z |
| publishDate | 2015 |
| publisher | Taylor & Francis Group |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | intimal-3382016-06-20T02:29:21Z http://eprints.intimal.edu.my/338/ LogiQL and Predicate Logic Halpin, Terry Rugaber, Spencer QA76 Computer software LogiQL is a programming language capable of computing correct answers for properly formulated problems. It has evolved from efforts to apply formal logical reasoning to databases, and this appendix describes the relationship between logic and LogiQL. In particular, the appendix describes how LogiQL is related to propositional logic and first-order predicate logic. Propositions are asserted by declarative sentences and are always true or false but not both. In propositional logic, atomic propositions are denoted by propositional constants (e.g., R = “It is raining”; S = “It is snowing”). Compound propositions are formed by applying propositional operators to other propositions, using parentheses if needed. For example, using ∼ for the negation operator and ∧ for the conjunction operator, we could use the formula ∼(R∧S) to denote the proposition that “It is not both raining and snowing.” Results about propositional patterns are indicated by using propositional variables (e.g., p, q) to stand for any propositions in general. For example, ∼∼p is equivalent to p regardless of which proposition is substituted for p. First-order logic (FOL), also called first-order predicate logic, predicate calculus, or quantification theory, extends propositional logic with predicates, quantifiers, and individual constants. In logic, an individual is any individual object (entity or value). For a given universe of discourse, specific individuals are denoted by individual constants (e.g., terry), and specific predicates are denoted by predicate constants with their arguments in parentheses, for example, isTallerThan(terry,norma). General results may be stated using individual variables (to range over any individual) and quantifiers. The universal quantifier ∀ means “for each” or “for all.” Taylor & Francis Group 2015 Book Section PeerReviewed text en http://eprints.intimal.edu.my/338/1/17_ft.pdf Halpin, Terry and Rugaber, Spencer (2015) LogiQL and Predicate Logic. In: LogiQL: A Query Language for Smart Databases. Taylor & Francis Group, pp. 279-288. ISBN 9781482244939 |
| spellingShingle | QA76 Computer software Halpin, Terry Rugaber, Spencer LogiQL and Predicate Logic |
| title | LogiQL and Predicate Logic |
| title_full | LogiQL and Predicate Logic |
| title_fullStr | LogiQL and Predicate Logic |
| title_full_unstemmed | LogiQL and Predicate Logic |
| title_short | LogiQL and Predicate Logic |
| title_sort | logiql and predicate logic |
| topic | QA76 Computer software |
| url | http://eprints.intimal.edu.my/338/ http://eprints.intimal.edu.my/338/1/17_ft.pdf |