CSP - A vocabulary to represent Constraint Satisfaction Problems. | DERI Vocabularies

CSP - A vocabulary to represent Constraint Satisfaction Problems.

Authors:

Alexandre Passant (DERI, NUI Galway)

Fadi Badra (DERI, NUI Galway)

François-Paul Servant (Renault) (Email)

Last update:

29 June 2011

Namespace URI:

http://vocab.deri.ie/csp#

Abstract

A vocabulary to represent Constraint Satisfaction Problems (CSPs) in which constraints are expressed by Boolean expressions on fluents.

All terms at a glance

Classes: And | BoolExpr | Fluent | Not | Or | Relation | Solution

Properties: and | isSatisfiable | not | or | supports | val | var | variable

Overview diagram

This vocabulary is used to represent the main Product Range Specification (PRS) objects of the car manufacturer Renault. PRS is used to specify the set of all possible car congurations that an automaker can sell and constitutes a central part of the company's information system.

Classes

Class: csp:And

And – Models a conjunctive logical sub-expression AND (BoolExpr1 BoolExpr2 ... BoolExprn).

URI:: http://vocab.deri.ie/csp#And
Properties include:: csp:and
Superclass:: csp:BoolExpr
Disjoint with:: csp:Or, csp:Not

Class: csp:BoolExpr

Boolean expression – A Boolean expression.

URI:: http://vocab.deri.ie/csp#BoolExpr
Used with:: csp:and, csp:or, csp:not
Subclasses:: csp:Fluent, csp:And, csp:Or, csp:Not

Class: csp:Fluent

Fluent – A fluent is the association of a variable name and a subset of its domain of values.

URI:: http://vocab.deri.ie/csp#Fluent
Properties include:: csp:var, csp:val
Superclass:: csp:BoolExpr

Class: csp:Not

Not – Models the negation of a logical sub-expression NOT(BoolExpr).

URI:: http://vocab.deri.ie/csp#Not
Properties include:: csp:not
Superclass:: csp:BoolExpr
Disjoint with:: csp:And, csp:Or

Class: csp:Or

Or – Models a disjunctive logical sub-expression OR (BoolExpr1 BoolExpr2 ... BoolExprn).

URI:: http://vocab.deri.ie/csp#Or
Properties include:: csp:or
Superclass:: csp:BoolExpr
Disjoint with:: csp:And, csp:Not

Class: csp:Relation

Relation – The list of all valid combinations of values of a set of variables.

URI:: http://vocab.deri.ie/csp#Relation
Properties include:: csp:isSatisfiable, csp:supports

Class: csp:Solution

Solution – A solution of the constraint satisfaction problem.

URI:: http://vocab.deri.ie/csp#Solution
Properties include:: csp:variable

Properties

Property: csp:and

and – Links a logical conjunction operator to its arguments.

URI:: http://vocab.deri.ie/csp#and
Domain:: csp:And
Range:: csp:BoolExpr

Property: csp:isSatisfiable

is satisfiable – Boolean flag indicating for a relation if each supported combination of values must be satisfiable or not.

URI:: http://vocab.deri.ie/csp#isSatisfiable
Domain:: csp:Relation

Property: csp:not

not – Links a logical negation operator to its argument.

URI:: http://vocab.deri.ie/csp#not
Domain:: csp:Not
Range:: csp:BoolExpr

Property: csp:or

or – Links a logical disjunction operator to its arguments.

URI:: http://vocab.deri.ie/csp#or
Domain:: csp:Or
Range:: csp:BoolExpr

Property: csp:supports

supports – Specifies all supported value combinations in the relation.

URI:: http://vocab.deri.ie/csp#supports
Domain:: csp:Relation
Range:: rdfs:Resource

Property: csp:val

has value – A value associated with a fluent.

URI:: http://vocab.deri.ie/csp#val
Domain:: csp:Fluent
Range:: rdfs:Resource

Property: csp:var

has variable – The variable associated with a fluent.

URI:: http://vocab.deri.ie/csp#var
Domain:: csp:Fluent
Range:: rdfs:Resource

Property: csp:variable

variable – A variable can be seen as a function associating a value to an object, and is therefore modelled as an RDF property that points to one (or many) value(s).

URI:: http://vocab.deri.ie/csp#variable
Domain:: csp:Solution
Range:: rdfs:Resource