Uninterpreted function: Difference between revisions

Revision as of 16:12, 13 June 2011

Latest revision as of 15:10, 21 September 2024

(48 intermediate revisions by 21 users not shown)

Line 1:

{{Short description|Type of function in mathematical logic}}

{{Context|date=October 2009}}

In [[mathematical logic]], an '''uninterpreted function'''<ref>Bryant,{{Cite Lahiri,book Seshia| (2002)chapter-url=https://link.springer.com/content/pdf/10.1007/3-540-45657-0_7.pdf |doi = 10.1007/3-540-45657-0_7|chapter = "Modeling and verifyingVerifying systemsSystems usingUsing a logicLogic of counterCounter arithmeticArithmetic with lambdaLambda expressionsExpressions and uninterpretedUninterpreted functions".Functions|title = ''Computer Aided Verification''|volume = '''2404/|pages = 78–92|series = Lecture Notes in Computer Science|year = 2002''',|last1 106&ndash;122= Bryant|first1 = Randal E.|last2 = Lahiri|first2 = Shuvendu K.|last3 = Seshia|first3 = Sanjit A.|isbn = 978-3-540-43997-4| s2cid=9471360 }}</ref> or '''function symbol'''<ref>{{cite book |author1last1=Baader |first1=Franz |authorlink1=Franz Baader |author2last2=Nipkow |first2=Tobias |authorlink2=Tobias Nipkow |year=1999 |title=Term Rewriting and All That|year=1999 |publisher=Cambridge University Press |isbn=9780521779203978-0-521-77920-3 |pagespage=34}}</ref> is one that has no other property than its name and arity.''[[Arity|n-ary]]'' form. Function symbols are used, together with constants and variables, to form [[term (logic)|terms]].

The '''theory of uninterpreted functions''' is also sometimes called the '''free theory''', because it is freely generated, and thus a [[free object]], or the '''empty theory''', being the [[theory (mathematical logic)|theory]] having an empty set of [[sentence (mathematical logic)|sentences]] (in analogy to an [[initial algebra]]). Theories with a non-empty set of equations are known as [[equational theory|equational theories]]. The [[decision problemsatisfiability]] problem for free theories is a [[satisfiability]] problem, and is solved by [[syntactic unification]].; Italgorithms isfor particularlythe important,latter asare manyused otherby theories can be reduced to it. Interpretersinterpreters for various computer languages, such as [[Prolog]],. requireSyntactic unification is also used in algorithms for solving the freesatisfiability theoryproblem for certain other equational theories, see [[Unification (computer science)]].

==Example==

As an example of uninterpreted functions for [[SMT-LIB]], if this input is given to an [[Satisfiability modulo theories|SMT solver]]:

<syntaxhighlight lang="text" line="1">

(declare-fun f (Int) Int)

(assert (= (f 10) 1))

</syntaxhighlight>

the SMT solver would return "This input is satisfiable". That happens because <code>f</code> is an uninterpreted function (i.e., all that is known about <code>f</code> is its [[Signature (logic)|signature]]), so it is possible that <code>f(10) = 1</code>. But by applying the input below:

<syntaxhighlight lang="text" line="1">

(declare-fun f (Int) Int)

(assert (= (f 10) 1))

(assert (= (f 10) 42))

</syntaxhighlight>

the SMT solver would return "This input is unsatisfiable". That happens because <code>f</code>, being a function, can never return different values for the same input.

== Discussion==

An [[array data structure|array]] can be specified by the following equational [[axiom]]:

The [[decision problem]] for free theories is particularly important, because many theories can be reduced by it.<ref>{{cite book |last1=de Moura |first1=Leonardo |last2=Bjørner |first2=Nikolaj |title=Formal methods : foundations and applications : 12th Brazilian Symposium on Formal Methods, SBMF 2009, Gramado, Brazil, August 19-21, 2009 : revised selected papers |date=2009 |publisher=Springer |___location=Berlin |isbn=978-3-642-10452-7 |url=https://leodemoura.github.io/files/sbmf09.pdf}}</ref>

Free theories can be solved by searching for [[common subexpression]]s to form the [[congruence closure]].{{clarify|reason=Indicate about solving which problem in free theories the sentence is supposed to speak. E.g. to solve the satisfiability problem of conjunctions of equations, the Martelli-Montanari syntactic unification algorithm suffices, neither common subexpressions nor congruence closures are needed. Maybe, satisfiability of arbitrary Boolean combinations of equations is meant?|date=May 2014}} Solvers include [[satisfiability modulo theories]] solvers.

: ''select''(''store''(''a'',''i'',''v''),''j'') = (if ''i'' = ''j'' then ''v'' else ''select''(''a'',''j''))

== See also ==

This axiom can be used to deduce

* [[algebraicAlgebraic data type]]

* [[initialInitial algebra]]

* [[termTerm algebra]]

* [[Theory of pure equality]]

==Notes==

: ''select''(''store''(''store''(''a'',1,−1),2,−2),1)

{{reflist|group=note}}

:: = ''select''(''store''(''a'',1,−1),1)

:: = −1

==References==

Note that this reasoning did '''not''' use any 'definition' or [[interpretation (logic)|interpretation]] for the functions ''select'' and ''store''. All that is known is the axiom.

{{reflist}}

== Discussion==

The [[decision problem]] for free theories is particularly important, as many theories can be reduced to it; the above example is the prototypical example of the theory of [[array data structure|arrays]], where 'select' and 'store' are the canonical array access functions<ref>J. McCarthy, (1962) "Towards a mathematical science of computation." '''IFIP Congress.''', pp. 21–28</ref>.

Free theories can be solved by searching for [[common subexpression]]s to form the [[congruence closure]]. Solvers include [[satisfiability modulo theories]] solvers.

== See also ==

* [[algebraic data type]]

* [[initial algebra]]

* [[term algebra]]

==References==

{{Reflist}}

{{Mathematical logic}}

{{Formalmethods-stub}}