نتایج جستجو برای: منطق order sorted

تعداد نتایج: 923770  

2011
YILAN GU MIKHAIL SOUTCHANSKI Yilan Gu Mikhail Soutchanski

We propose a theory for reasoning about actions based on order-sorted predicate logic where one can consider an elaborate taxonomy of objects. We are interested in the projection problem: whether a statement is true after executing a sequence of actions. To solve it we design a regression operator takes advantage of well-sorted unification between terms. We show that answering projection querie...

2010
Temur Kutsia Mircea Marin

We construct a sound and complete matching procedure for order-sorted terms with regular expression sorts and second-order variables. Since the theory is infinitary, there are matching problems on which the procedure does not terminate. Restricting the rules of the procedure, we obtain an incomplete terminating algorithm and give some examples of its possible applications in source code searching.

Journal: :J. Symb. Comput. 1998
Hubert Comon-Lundh

We consider a constrained equational logic where the constraints are membership conditions t 2 s where s is interpreted as a regular tree language. Our logic includes a fragment of second order equational logic (without projections) where second order variables range over regular sets of contexts. The problem with constrained equational logics is the failure of the critical pair lemma. That is ...

Journal: :CoRR 2016
Dohan Kim

This paper presents a distributed agent-based automated theorem proving framework based on ordersorted first-order logic. Each agent in our framework has its own knowledge base, communicating to its neighboring agent(s) using message-passing algorithms. The communication language between agents is restricted in such a manner that each agent can only communicate to its neighboring agent(s) by me...

Journal: :Progress in Human Geography 2005

Journal: :IEICE Transactions 2011
Ken Kaneiwa Riichiro Mizoguchi

This paper proposes a new semantics that characterizes the time and/or situation dependencies of properties, together with the ontological notion of existential rigidity. For this purpose, we present order-sorted tempo-situational logic (OSTSL) with rigid/anti-rigid sorts and an existential predicate. In this logic, rigid/anti-rigid sorted terms enable the expressions for sortal properties, and...

2014
Ting Kuo

A permutation ) ( 2 1 n π π π π  = of {1, 2,..., n} is called k-sorted if and only if , k i i ≤ −π for all . 1 n i ≤ ≤ We propose an algorithm for generating the set of all k-sorted permutations of {1, 2,..., n} in lexicographic order. An inversion occurs between a pair of ( i π , j π ) if i < j but i π > j π . Let I(n, k) denote the maximum number of inversions in k-sorted permutations. For k...

1998
Florent Jacquemard Christoph Meyer Christoph Weidenbach

We show that uniication in certain extensions of shallow equational theories is decidable. Our extensions generalize the known classes of shallow or standard equational theories. In order to prove de-cidability of uniication in the extensions, a class of Horn clause sets called sorted shallow equational theories is introduced. This class is a natural extension of tree automata with equality con...

1982
Christoph Walther

The f i rst-order calculus whose well formed formulas are clauses and whose sole inference rules are factor izat ion, resolution and paramodulation is extended to a many-sorted calculus. As a basis for Automated Theorem Proving, this many-sorted calculus leads to a remarkable reduction of the search space and also to simpler proofs. The soundness and completeness of the new calculus and the Sor...

Journal: :Transactions of the Japanese Society for Artificial Intelligence 2008

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید