Spill — A logic language for writing testable requirements specifications

Kluźniak, Feliks; Miłkowska, Mirosława

doi:10.1016/s0167-6423(96)00021-4

Cited by 6 publications

(3 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Before the compilation task, the user may select an optimization technique, such as simplification or partial evaluation, to obtain a more efficient target code. SPILL-2 (SPecifications In a Logic Language) is the second version of an executable typed logic language that is an extension of the Prolog-like language Goedel (Kluzniak and Milkowska 1997). A specification in SPILL-2 consists of a set of type declarations, a set of function declarations, a set of predicate declarations and a number of logical expressions (queries) that are used to test the specification.…”

Section: Specification Languagesmentioning

confidence: 99%

atalog: A logic language for expressing search and optimization problems

Greco

Molinaro

Trubitsyna

et al. 2010

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

This paper presents a logic language for expressing NP search and optimization problems. Specifically, first a language obtained by extending (positive) DATALOG with intuitive and efficient constructs (namely, stratified negation, constraints, and exclusive disjunction) is introduced. Next, a further restricted language only using a restricted form of disjunction to define (nondeterministically) subsets (or partitions) of relations is investigated. This language, called NP Datalog, captures the power of DATALOG ¬ in expressing search and optimization problems. A system prototype implementing NP Datalog is presented. The system translates NP Datalog queries into Optimization Programming Language (OPL) programs which are executed by the ILOG OPL Development Studio. Our proposal combines easy formulation of problems, expressed by means of a declarative logic language, with the efficiency of the ILOG System. Several experiments show the effectiveness of this approach.

show abstract

Section: Specification Languagesmentioning

confidence: 99%

atalog: A logic language for expressing search and optimization problems

Greco

Molinaro

Trubitsyna

et al. 2010

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

show abstract

“…Further, it should be noted that bounded quantifiers and arrays were also studied in logic programming. In particular, they are used in the specification language Spill of Kluźniak & Mi lkowska (1997) that allows us to write executable, typed, specifications in the logic programming style. Other related references are Voronkov (1992), Barklund & Bevemyr (1993) and Apt (1996).…”

Section: Relation To Logic Programmingmentioning

confidence: 99%

Formulas as Programs

Apt

Bezem

1999

The Logic Programming Paradigm

View full text Add to dashboard Cite

We provide here a computational interpretation of first-order logic based on a constructive interpretation of satisfiability w.r.t. a fixed but arbitrary interpretation. In this approach the formulas themselves are programs. This contrasts with the so-called formulas as types approach in which the proofs of the formulas are typed terms that can be taken as programs. This view of computing is inspired by logic programming and constraint logic programming but differs from them in a number of crucial aspects.Formulas as programs is argued to yield a realistic approach to programming that has been realized in the implemented programming language Alma-0 Apt, Brunekreef, Partington & Schaerf (1998) that combines the advantages of imperative and logic programming. The work here reported can also be used to reason about the correctness of non-recursive Alma-0 programs that do not include destructive assignment.

show abstract

“…In general, formal notations are not executable, although there are some directly executable formal notations such as Spill [3] and OBJ [4,5]. There are conflicting points of view about the advisability of a notation being executable.…”

Section: Introductionmentioning

confidence: 99%

The Application of Machine Learning Tools to the Validation of an Air Traffic Control Domain Theory

West

McCluskey

2001

Int. J. Artif. Intell. Tools

View full text Add to dashboard Cite

In this paper we describe a project (IMPRESS) in which machine learning (ML) tools were created and utilised for the validation of an Air Traffic Control domain theory written in first order logic. During the project, novel techniques were devised for the automated revision of general clause form theories using training examples. These techniques were combined in an algorithm which focused in on the parts of a theory which involve ordinal sorts, and applied geometrical revision operators to repair faulty component parts. While we illustrate the feasibility of applying ML to this area, we conclude that to be effective it must be focused to the application at hand, and used in mixed-initiative mode within a tools environment. The method is illustrated with experimental results obtained during the project.

show abstract

Spill — A logic language for writing testable requirements specifications

Cited by 6 publications

References 4 publications

atalog: A logic language for expressing search and optimization problems

atalog: A logic language for expressing search and optimization problems

Formulas as Programs

The Application of Machine Learning Tools to the Validation of an Air Traffic Control Domain Theory

Contact Info

Product

Resources

About