Sentence examples for logic-based language from inspiring English sources

We take as a representative for this scenario the logic-based language ReSpecT (Reaction Specification Tuples), used to program the reactive behaviour of tuple centres.

Problems are specified in a logic-based language, called np-spec, which allows the definition of complex problems in a highly declarative way, and whose expressive power is such as to capture all problems which belong to the complexity class NP.

The trade-off between the expressive power and the tractability of a logic-based language is a fundamental one: increasing the expressivity of the language usually results in a more resource-consuming reasoning algorithm or even undecidability.

Initially, this structure was not expressed in a formal logic-based language.

The need for decidable formalisms has been the driving force behind the development of Description Logics (DLs), a family of logic-based languages with well-understood computational properties and rich expressivity.

They distinguish ad hoc expressions, Arden Syntax, logic-based languages, object-oriented query languages and temporal query languages.

Technical challenges arising from the non-structured representation of eligibility criteria within study protocols have been met with successful demonstrations of intermediate formats, such as Arden Syntax [ 4], ad hoc expressions [ 5] and Logic-based languages [ 6].

In Part I of this series of papers, we have proposed a new logic-based planning language, called K.

The concept exploits the capabilities of semantically well-defined core concepts formalised in a Common Logic-based ontology language.

The logic-based representation is based on classic logic programming language and can directly support automated compliance checking.

TRIPLE can be viewed as a successor of SiLRI (Simple Logic-based RDF Interpreter [QL'98 The Query Languages Workshop, 1998]).