A multiset (mset, for short) is an unordered collection of objects (called the elements) in
which, unlike a standard (Cantorian) set, elements are allowed to repeat. In other words, an …

Term graph rewriting is concerned with the representation of functional expressions as
graphs, and the evaluation of these expressions by rule-based graph transformation …

Testing involves examining the behaviour of a system in order to discover potential faults.
Given an input for a system, the challenge of distinguishing the corresponding desired …

We present YAGO, a light-weight and extensible ontology with high coverage and quality.
YAGO builds on entities and relations and currently contains more than 1 million entities and …

Abstract Satisfiability Modulo Theories (SMT) refers to the problem of determining whether a
first-order formula is satisfiable with respect to some logical theory. Solvers based on SMT …

This chapter outlines the concepts and techniques that underlie reasoning in Isabelle. Until
now, we have proved everything using only induction and simplification, but any serious …

A comprehensive introduction to type systems and programming languages. A type system
is a syntactic method for automatically checking the absence of certain erroneous behaviors …

Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

SPARQL is the standard language for querying RDF data. In this article, we address
systematically the formal study of the database aspects of SPARQL, concentrating in its …

This article presents YAGO, a large ontology with high coverage and precision. YAGO has
been automatically derived from Wikipedia and WordNet. It comprises entities and relations …