The term derives from the grammatical term "predicate", meaning a word or phrase that represents a property or relation.
Formulaic language
Formulaic language (previously known as automatic speech or embolalia) is a linguistic term for verbal expressions that are fixed in form, often non-literal in meaning, with attitudinal nuances, and closely related to communicative-pragmatic context.[1]
Abstract syntax and variable binding
We develop a theory of abstract syntax with variable binding. To every binding signature we associate a category of models consisting of variable sets endowed with compatible algebra and substitution structures. The syntax generated by the signature is the initial model. This gives a notion of initial algebra semantics encompassing the traditional one; besides compositionality, it automatically verifies the semantic substitution lemma.
Datalog
Datalog is a declarative logic programming language. While it is syntactically a subset of Prolog, Datalog generally uses a bottom-up rather than top-down evaluation model. This difference yields significantly different behavior and properties from Prolog. It is often used as a query language for deductive databases. Datalog has been applied to problems in data integration, networking, program analysis, and more.
Finite-Choice Logic Programming | Proceedings of the ACM on Programming Languages
Logic programming, as exemplified by datalog, defines the meaning of a program as its unique smallest model: the deductive closure of its inference rules. However, many problems call for an enumeration of models that vary along some set of choices while ...
Institutions: abstract model theory for specification and programming | Journal of the ACM
There is a population explosion among the logical systems used in computing science. Examples include first-order logic, equational logic, Horn-clause logic, higher-order logic, infinitary logic, dynamic logic, intuitionistic logic, order-sorted logic, ...
Functorial data migration
In this paper we present a simple database definition language: that of categories and functors. A database schema is a small category and an instance is a set-valued functor on it. We show that morphisms of schemas induce three “data migration functors”, which translate instances from one schema to the other in canonical ways. These functors parameterize projections, unions, and joins over all tables simultaneously and can be used in place of conjunctive and disjunctive queries. We also show how to connect a database and a functional programming language by introducing a functorial connection between the schema and the category of types for that language. We begin the paper with a multitude of examples to motivate the definitions, and near the end we provide a dictionary whereby one can translate database concepts into category-theoretic concepts and vice versa.
GoodRelations - W3C Wiki
GoodRelations is a lightweight ontology for exchanging e-commerce information, namely data about products, offers, points of sale, prices, terms and conditions, on the Web. It can be used in all RDF syntaxes (like RDF/XML, Turtle, RDFa, JSON-LD, ...), Microdata, and basically any syntax that supports an Entitity-Attribute-Value pattern.
OWL - Semantic Web Standards
The W3C Web Ontology Language (OWL) is a Semantic Web language designed to represent rich and complex knowledge about things, groups of things, and relations between things. OWL is a computational logic-based language such that knowledge expressed in OWL can be exploited by computer programs, e.g., to verify the consistency of that knowledge or to make implicit knowledge explicit. OWL documents, known as ontologies, can be published in the World Wide Web and may refer to or be referred from other OWL ontologies. OWL is part of the W3C’s Semantic Web technology stack, which includes RDF, RDFS, SPARQL, etc.
4-Clause BSD Explained in Plain English - TLDRLegal
4-Clause BSD summarized/explained in plain English.
Glossary of terms - AT Protocol
A collection of terminology used in the AT Protocol and their definitions.
Temporal Logic
Broadly construed, Temporal Logic covers all formalapproaches to representing and reasoning about time and temporalinformation. More narrowly, it usually refers to the modal-logic styleapproach introduced by Arthur Prior in the 1950s under the nameTense Logic and subsequently developed further by manylogicians and computer scientists. Temporal Logic has been widely usedas a formalism for clarifying philosophical issues about time, as aframework for defining the semantics of temporal expressions innatural language, as a language for encoding temporal knowledge inartificial intelligence, and as a tool for specification andverification of computer programs and systems.
The semantics of clear, a specification language
This paper gives a semantics for the Clear language for specifying problems and programs, described by Burstall and Goguen in 1977. A blend of denotational semantics with categorical ideas is used.
Introduction to Higher-Order Categorical Logic (Cambridge Studies in Advanced Mathematics)
Introduction to higher order catagorical logic by J. Lambek, March 25, 1988, Cambridge University Press edition, Paperback in English
Probabilistic compositional semantics, purely
We provide a general framework for the integration of formal semantics with probabilistic reasoning. This framework is conservative, in the sense that it relies only on typed λ-calculus and is thus co