Efficiently Enforcing Path Consistency on Qualitative Constraint Networks by Use of Abstraction
|
|
- Cynthia Mills
- 5 years ago
- Views:
Transcription
1 Efficiently Enforcg Path Consistency on Qualitative Constrat Networks by Use of Abstraction Michael Sioutis and Jean François Condotta Université d Artois, CRIL-CNRS UMR 8188, Lens, France {sioutis,condotta}@cril.fr Abstract Partial closure under weak composition, or partial -consistency for short, is essential for tacklg fundamental reasong problems associated with qualitative constrat networks, such as the satisfiability checkg problem, and therefore it is crucial to be able to enforce it as fast as possible. To this end, we propose a new algorithm, called PWC α, for efficiently enforcg partial -consistency on qualitative constrat networks, that eploits the notion of abstraction for qualitative constrat networks, utilies certa properties of partial -consistency, and adapts the functionalities of some state-of-theart algorithms to its design. It is worth notg that, as opposed to a related approach the recent literature, algorithm PWC α is complete for arbitrary qualitative constrat networks. The evaluation that we conducted with qualitative constrat networks of the Region Connection Calculus agast a competg state-of-the-art generic algorithm for enforcg partial -consistency, demonstrates the usefulness and efficiency of algorithm PWC α. 1 Introduction Qualitative Spatial and Temporal Reasong (QSTR) is a major field of study Artificial Intelligence, and Knowledge Representation & Reasong particular. This field has received a lot of attention over the past decades, as it etends to a plethora of areas and domas that clude ambient telligence, dynamic GIS, cognitive robotics, and spatiotemporal design [Bhatt et al., 2011]. QSTR abstracts from numerical quantities of space and time by usg qualitative descriptions stead (e.g., precedes, contas, is left of ), thus providg a concise framework that allows for rather epensive reasong about entities located space and time. The problem of representg and reasong about qualitative formation can be modeled as a qualitative constrat network (QCN), i.e., a network of constrats correspondg to qualitative spatial or temporal relations between spatial or temporal variables respectively, usg a qualitative constrat language. A qualitative constrat language volves constrats defed over a fite set of bary relations, called base relations (or atoms) [Ligoat and Ren, 2004]. The fundamental reasong problems associated with a given QCN N are the problems of satisfiability checkg, mimal labelg (or deductive closure), and redundancy (or entailment) [Ren and Nebel, 2007]. In particular, the satisfiability checkg problem is the problem of decidg if there eists a spatial or temporal valuation of the variables of N that satisfies its constrats, such a valuation beg called a solution of N, the mimal labelg problem is the problem of fdg the strongest implied constrats of N, and the redundancy problem is the problem of determg if a given constrat is entailed by N (that constrat beg called redundant, as its removal does not change the solution set of the QCN). In general, for most qualitative constrat languages the satisfiability checkg problem is NP-complete. Further, the redundancy problem, the mimal labelg problem, and the satisfiability checkg problem are equivalent under polynomial Turg reductions [Golumbic and Shamir, 1993]. The vast amount, if not all, of the published works that study the aforementioned reasong problems, use partial -consistency as a means to defe practical algorithms for efficiently tacklg them [Amanedde et al., 2013; Sioutis et al., 2015; 2016b; Li et al., 2015; Ren and Nebel, 2001; Nebel, 1997]. Given a QCN N and a graph G, partial -consistency with respect to G, denoted by G -consistency, entails (weak) consistency for all triples of variables N that correspond to three-verte cycles (triangles) G. We note that if G is complete, G -consistency becomes identical to -consistency [Ren and Ligoat, 2005]. Hence, -consistency is a special case of G-consistency. In fact, earlier works have relied solely on -consistency; it was not until the troduction of chordal (or triangulated) graphs QSTR, due to some generalied theoretical results of [Huang, 2012], that researchers started restrictg -consistency to a triangulation of the constrat graph of an put QCN and benefitg from better compleity properties. Currently, and to the best of our knowledge, the fastest algorithm for enforcg partial -consistency, which is presented [Long et al., 2016], is complete only for certa subsets of the set of allowed relations that can occur a QCN. This fact significantly limits its practicality for arbitrary QCNs. Further, sce those subsets defe subclasses of relations that are general smaller than the classes of relations for which partial -consistency is able to decide satisfiability, the algorithm of [Long et al., 2016] is able to tackle 1262
2 fewer QCNs comparison with a generic algorithm for enforcg partial -consistency. To ameliorate this issue, we eploit the notion of abstraction for QCNs, which is an idea adopted from concepts of abstract terpretation [Cousot and Cousot, 1992]. In particular, a QCN is typically abstracted by relag some of its constrats order to satisfy some property (if possible); our case, we aim to abstract a given QCN is such a way that all of its constrats volve relations for which the algorithm of [Long et al., 2016] is complete. This should allow us to harvest as much of the performance gas of that algorithm as possible for an arbitrary QCN N, as we can use the algorithm to enforce partial -consistency on a proper abstraction of N very fast, and then crementally apply appropriate constrat propagations on its output QCN to achieve partial -consistency pertag to the origal QCN N. Specifically, we make the followg contributions: (i) we provide an efficient and generic algorithm for enforcg partial -consistency that eploits the notion of abstraction for QCNs and makes full use of the algorithm of [Long et al., 2016], (ii) we prove the correctness of our approach by utilig certa properties of partial -consistency, such as idempotence and monotonicity, and (iii) we eperimentally validate the usefulness and efficiency of our method agast the state-of-the-art generic algorithm for enforcg partial -consistency of [Chmeiss and Condotta, 2011]. 2 Prelimaries y {EC} {EC} {EC} A (bary) qualitative spatial or temporal constrat language, is based on a fite set B of jotly ehaustive and pairwise disjot relations defed over an fite doma D, which is called the set of base relations [Ligoat and Ren, 2004]. The base relations of a particular qualitative constrat language can be used to represent the defite knowledge between any two of its entities with respect to the level of granularity provided by the doma D. The set B contas the identity relation Id, and is closed under the converse operation ( 1 ). Indefite knowledge can be specified by a union of possible base relations, and is represented by the set contag them. Hence, 2 B represents the total set of relations. The set 2 B is equipped with the usual set-theoretic operations of union and tersection, the converse operation, and the weak composition operation denoted by the symbol [Ligoat and Ren, 2004]. For all r 2 B, we have that r 1 = {b 1 b r}. The weak composition () of two base relations b, b B is defed as the smallest (i.e., strongest) relation r 2 B that cludes b b, or, formally, b b ={b B b (b b ) }, where b b ={(, y) D D D such that (, ) b (, y) b } is the (true) composition of b and b. For all r, r 2 B, we have that r r = {b b b r, b r }. As an eample, the Region Connection Calculus (RCC) is a first-order theory for representg and reasong about mereotopological formation [Randell et al., 1992]. The doma D of RCC comprises all possible non-empty regular subsets of some topological space. These subsets do not have to be ternally connected and do not have a particular dimension, but are commonly required to be regular closed [Ren, 2002]. Simply put, a subset X of a topological space is regular closed that space, if X equals the cloy Figure 1: A QCN of RCC-8 along with a solution sure of its terior. The base relations of RCC are the followg ones: disconnected (DC), eternally connected (EC), equal (EQ), partially overlappg (P O), tangential proper part (T P P ), tangential proper part verse (T P P i), nontangential proper part (NT P P ), and non-tangential proper part verse (NT P P i). These eight base relations form the RCC-8 constrat language. Relation EQ is the identity relation Id of RCC-8. Other notable and well known qualitative spatial and temporal constrat languages clude Pot Algebra [Vila and Kaut, 1986], Cardal Direction Calculus [Ligoat, 1998; Frank, 1991], Interval Algebra [Allen, 1983], and Block Algebra [Balbiani et al., 2002]. The weak composition operation, the converse operation 1, the union operation, the complement operation, and the total set of relations 2 B along with the identity relation Id of a qualitative constrat language, form an algebraic structure (2 B, Id,, 1,, ) that can correspond to a relation algebra the sense of Tarski [Tarski, 1941]. Proposition 1 ([Dylla et al., 2013]). The languages of Pot Algebra, Cardal Direction Calculus, Interval Algebra, Block Algebra, and RCC-8 are each a relation algebra with the algebraic structure (2 B, Id,, 1,, ). In what follows, for a qualitative constrat language that is a relation algebra with the algebraic structure (2 B, Id,, 1,, ), we will simply use the term relation algebra, as the algebraic structure will always be of the same format. The problem of representg and reasong about qualitative formation can be modeled as a qualitative constrat network (QCN), defed the followg manner: Defition 1. A qualitative constrat network (QCN) is a tuple (V, C) where: V = {v 1,..., v n } is a non-empty fite set of variables, each representg an entity; and C is a mappg C : V V 2 B such that C(v, v) = {Id} for all v V and C(v, v ) = (C(v, v)) 1 for all v, v V. An eample of a QCN of RCC-8 is shown Figure 1. In particular, the QCN comprises the set of variables {, y, } and the constrats C(, y) = C(y, ) = C(, ) = {EC}; for simplicity, converse relations as well as Id loops are not mentioned or shown the figure. Defition 2. Let N = (V, C) be a QCN, then: a solution of N is a mappg σ : V D such that (u, v) V V, b C(u, v) such that (σ(u), σ(v)) b; N is satisfiable iff it admits a solution; a QCN is equivalent to N iff it admits the same set of solutions as N ; a sub-qcn N of N, denoted by N N, is a QCN (V, C ) such that C (u, v) C(u, v) u, v V ; the constrat graph of N is the graph (V, E) where {u, v} E iff C(u, v) B and u v; and N is trivially consistent iff u, v V such that C(u, v) =. 1263
3 y {DC} {P O, NT P P } {EC, T P P } y {DC} {P O, TPP, NT P P } {EC, PO, T P P } Figure 2: A QCN of RCC-8 along with an abstraction We recall the followg defition of G-consistency, which, as noted the troduction, is the basic local consistency used the literature for solvg fundamental reasong problems of QCNs, such as the satisfiability checkg problem. Defition 3. Given a QCN N = (V, C) and a graph G = (V, E), N is G -consistent iff {v i, v j }, {v i, v k }, {v k, v j } E we have that C(v i, v j ) C(v i, v k ) C(v k, v j ). It is route to formally prove the followg properties of G -consistency, which we will use the sequel, as they naturally derive from respective properties of -consistency: Property 1. Let N = (V, C) be a QCN and G = (V, E) a graph. Then, the followg properties hold: G (N ) N (vi., the G-closure of N ) is the largest (w.r.t. ) G-consistent sub-qcn of N (Domance); G (N ) is equivalent to N (Equivalence); G ( G (N )) = G (N ) (Idempotence); if N N then G (N ) G (N ) (Monotonicity). We note aga that if G is complete, G-consistency becomes identical to -consistency [Ren and Ligoat, 2005], and, hence, -consistency is a special case of G -consistency. Defition 4. A subclass of relations is a subset A 2 B that contas the sgleton relations of 2 B and is closed under converse, tersection, and weak composition. Given a relation r of 2 B and a subclass A 2 B contag B, A(r) denotes the smallest relation of A that cludes r. Defition 5. Given a QCN N = (V, C), a graph G = (V, E), and a subclass A 2 B contag B, the abstraction of N w.r.t. to A and G, denoted by A G (N ), is the QCN (V, C ) where C (v, v ) = A(C(v, v )) {v, v } E. As an eample, Figure 2 illustrates the abstraction of a QCN of RCC-8 w.r.t. to the subclass that results from the closure of the base relations of RCC-8 under converse, tersection, and weak composition (which, addition, contas B) and the complete graph on its set of variables. Given three relations r, r, r 2 B, we say that weak composition distributes over tersection if we have that r (r r ) = (r r ) (r r ) and (r r ) r = (r r) (r r). Defition 6. A subclass A is distributive iff weak composition distributes over non-empty tersection r, r, r A. Distributive subclasses of relations contag the universal relation B are defed for all of the qualitative constrat languages mentioned Proposition 1 [Long and Li, 2015]. 3 G -Consistency by Use of Abstraction The ma idea behd our approach, is to benefit as much as possible from the performance characteristics of the algorithm for enforcg partial -consistency of [Long et al., Algorithm 1: PWC α (N, G, α, A) : A QCN N = (V, C), a graph G = (V, E), a bijection α : V {0, 1,..., V 1}, and a subclass A of 2 B. 1 beg 2 N = (V, C ) A G (N ); 3 (decision, N ) DPWC+(N, G, α); 4 if decision = False then 5 return (False, N ); 6 e ; 7 foreach {v, v } E do 8 r C (v, v ) C(v, v ); 9 if r = then return (False, N ); 10 if r C (v, v ) then 11 e e {{v, v }}; 12 C (v, v ) r; 13 C (v, v) r 1 ; 14 return PWC(N, G, e); 2016], when given an arbitrary QCN N. As noted the troduction, that algorithm is complete only for certa subsets of 2 B. Those subsets essentially defe subclasses of relations that are distributive (see Defition 6). Hence, to be able to make full use of the algorithm of [Long et al., 2016], we utilie an abstraction of N with respect to some distributive subclass of relations, feed that abstraction to the algorithm, compare its output QCN N with our itial QCN N and properly update N, and fally employ a generic algorithm for enforcg partial -consistency to crementally apply appropriate constrat propagations on the updated QCN N and achieve partial -consistency pertag to the origal QCN N. An algorithm that follows the aforementioned steps is presented Algorithm 1, called PWC α (which stands for partial closure under weak composition by use of abstraction), where subroute DPWC+ le 3 (which stands for directional partial closure under weak composition plus) corresponds to a generalied version of the algorithm of [Long et al., 2016] and subroute PWC le 14 (which stands for partial closure under weak composition) is the state-of-the-art generic algorithm for enforcg partial -consistency of [Chmeiss and Condotta, 2011]. As opposed to the origal algorithm of [Long et al., 2016], its generalied version, vi., algorithm DPWC+, restricts consistency checks to constrats correspondg to edges of a given put graph G. Algorithm DPWC+, as well as its subroute, algorithm DPWC, are presented Algorithms 2 and 3 respectively. For completeness, algorithm PWC is presented Algorithm 4. With respect to algorithm DPWC+, we can prove the followg result: Proposition 2 (cf. [Long et al., 2016]). Given a not trivially consistent QCN N = (V, C) defed over a distributive subclass of relations of a relation algebra, a chordal graph G = (V, E), and a bijection α : V {0, 1,..., V 1} such that (α 1 ( V 1),α 1 ( V 2),...,α 1 (0)) is a perfect elimation orderg of G, algorithm DPWC+ returns (True, G (N )) if G (N ) is not trivially consistent, and (False, N ) 1264
4 Algorithm 2: DPWC+(N, G, α) : A QCN N = (V, C), a graph G = (V, E), and a bijection α : V {0, 1,..., V 1}. 1 beg 2 (decision, N ) DPWC(N, G, α); 3 if decision = False then 4 return (False, N ); 5 for from 1 to V 1 do 6 v α 1 (); 7 foreach v V {v, v} E α(v ) < α(v) do 8 adj {v V {v, v}, {v, v } E 9 α(v ) < α(v)}; 10 C(v, v ) v adj C(v, v ) C(v, v ); 11 C(v, v) (C(v, v )) 1 ; 12 return (True, N ); Algorithm 3: DPWC(N, G, α) : A QCN N = (V, C), a graph G = (V, E), and a bijection α : V {0, 1,..., V 1}. 1 beg 2 for from V 1 to 1 do 3 v α 1 (); 4 adj {v V {v, v} E α(v ) < α(v)}; 5 foreach v, v adj {v, v } E 6 α(v ) < α(v ) do 7 r C(v, v ) (C(v, v) C(v, v )); 8 if r = then return (False, N ); 9 if r C(v, v ) then 10 C(v, v ) r; 11 C(v, v ) r 1 ; 12 return (True, N ); with N N otherwise. As shown [Long et al., 2016], algorithm DPWC+ (at least its origal and more particular version as it appears that work) ehibits outstandg performance comparison with algorithm PWC for enforcg partial -consistency on QCNs defed over a distributive subclass of relations. Due to space constrats, it is not possible to detail the functionality of that algorithm; however, it should suffice to say that it utilies partial -consistency as its core local consistency [Sioutis et al., 2016a], which is enforced by algorithm DPWC, and eploits unique properties of distributive subclasses of relations to achieve partial -consistency a given QCN defed over such a subclass. In summary, partial -consistency is partial -consistency restricted (directionally) to a variable orderg α of the considered QCN. On the other hand, algorithm PWC is both efficient and complete for enforcg partial -consistency on arbitrary QCNs. With respect to algorithm PWC, we recall the followg result: Proposition 3 ([Chmeiss and Condotta, 2011]). Given a not trivially consistent QCN N = (V, C) of a relation alge- Algorithm 4: PWC(N, G, e ) : A QCN N = (V, C), a graph G = (V, E), and optionally a set e such that e E. 1 beg 2 Q (e if e else E); 3 while Q do 4 {v, v } Q.pop(); 5 foreach v V {v, v }, {v, v } E do 6 r C(v, v ) (C(v, v ) C(v, v )); 7 if r = then return (False, N ); 8 if r C(v, v ) then 9 C(v, v ) r; 10 C(v, v) r 1 ; 11 Q Q {{v, v }}; 12 r C(v, v ) (C(v, v) C(v, v )); 13 if r = then return (False, N ); 14 if r C(v, v ) then 15 C(v, v ) r; 16 C(v, v ) r 1 ; 17 Q Q {{v, v }}; 18 return (True, N ); bra, and a graph G = (V, E), algorithm PWC returns (True, G (N )) if G (N ) is not trivially consistent, and (False, N ) with N N otherwise. Havg presented the structure and the core components of algorithm PWC α, we obta the followg lemma to be used for establishg the correctness of our algorithm the sequel: Lemma 1. Let N = (V, C ) and N = (V, C) be two QCNs such that N N. Then, we have that G (N ) G (N ) N. Proof. As N N, by monotonicity of G-consistency we have that G (N ) G (N ). Moreover, sce it also holds that G (N ) N, it follows that G (N ) G (N ) N. The followg result states that algorithm PWC α is complete for enforcg partial -consistency on arbitrary QCNs: Theorem 1. Given a not trivially consistent QCN N = (V, C) of a relation algebra, a distributive subclass of relations A of that relation algebra, a chordal graph G = (V, E), and a bijection α : V {0, 1,..., V 1} such that (α 1 ( V 1),α 1 ( V 2),...,α 1 (0)) is a perfect elimation orderg of G, algorithm PWC α returns (True, G (N )) if G (N ) is not trivially consistent, and (False, N ) with N N otherwise. Proof. Let N = A G (N ). Clearly, N N. As N is defed over a distributed subclass of relations, by Proposition 2 we have that, le 3 of algorithm PWC α, algorithm DPWC+ returns (False, N ) with N N if G (N ) is trivially consistent, and (True, G (N )) otherwise. By monotonicity of G -consistency we have that G (N ) G (N ). Thus, algorithm PWC α le 5 returns (False, N ) only if G (N ) is trivially consistent. Assumg that G (N ) is not 1265
5 trivially consistent and the algorithm contues its eecution, the operation G (N ) N is performed les 7 13 of algorithm PWC α. By Lemma 1 we have that G (N ) G (N ) N. Hence, if G (N ) N defes a trivially consistent QCN, then G (N ) is trivially consistent. Therefore, algorithm PWC α le 9 returns (False, N ) only if G (N ) is trivially consistent. Let M = G (N ) N, and further assume that M is not trivially consistent and the algorithm contues its eecution. M is a not trivially consistent QCN that results by tighteng some of the constrats of G (N ). Note also that M N ; hence, by monotonicity of G -consistency we have that G (M) G (N ). In addition, as we have already established that G (N ) M, by monotonicity of G -consistency we have that G ( G (N )) G (M), and by idempotence of G -consistency it follows that G (N ) G (M). Consequently, we have that G (N ) = G (M). Now, by utilig the cremental functionality of algorithm PWC, we need only feed the algorithm with the QCN M, the graph G, and the set of edges that correspond to the tightened constrats of G (N ) order to obta G (M) (see [Gerevi, 2005, Section 3]). Thus, by Proposition 3 we have that, le 14 of algorithm PWC α, algorithm PWC returns (True, G (M)) if G (M) is not trivially consistent, and (False, M ) with M M otherwise. Sce G (N ) = G (M), we deduce that algorithm PWC α returns (True, G (N )) if G (N ) is not trivially consistent, and (False, N ) with N N otherwise. Regardg time compleity, given a QCN N = (V, C) and a graph G = (V, E) with a maimum verte degree, algorithm PWC α runs O(ma{ 2 V, E B }) time, as the run-times of DPWC+ and PWC are O( 2 V ) [Long et al., 2016] and O( E B ) [Chmeiss and Condotta, 2011] respectively. In terms of the number of triangles t G, and assumg that V + E O(t), algorithm PWC α runs O(t B ) time. However, dependg on the percentage of distributive relations that are the given QCN N and the quality of the abstraction that is obtaed with respect to a given distributive subclass of relations, algorithm DPWC+ (employed le 3 of algorithm PWC α ) may dimish that run-time practice, as it runs O(t) time [Long et al., 2016], which is dependent of the sie of the set of base relations B. We will eplore the aforementioned implication by means of a thorough eperimental evaluation the followg section. 4 Eperimental Evaluation We evaluated the performance of an implementation of algorithm PWC α, agast an implementation of the state-ofthe-art generic algorithm for enforcg partial -consistency PWC, with a varied dataset of arbitrary QCNs of RCC-8. Technical Specifications. The evaluation was carried out on a computer with an Intel Core i7-2820qm processor (which has a frequency of 2.30 GH per CPU core), 8 GB of RAM, and the Trusty Tahr OS (Ubuntu Lu). All algorithms were coded Python and run usg the standard CPython 2.7 terpreter. Only one CPU core was used. Datasets and Measures. We considered random scale-free RCC-8 networks generated by the BA(n, m) model [Barabasi and Albert, 1999], the use of which qualitative constratbased reasong is well motivated [Sioutis et al., 2016b], and random (unstructured) RCC-8 networks generated by the A(n, d, l) model [Ren and Nebel, 2001], which has been traditionally employed over the past decades the literature. Each of the aforementioned models was enriched with a parameter r d that allowed us to specify the percentage of distributive relations we would like to have our RCC-8 networks. In particular, we used the enriched BA(n, m, r d ) model to create random scale-free RCC-8 constrats graphs of order n, with a preferential attachment value m, and with r d % of distributive relations, and the enriched A(n, d, l, r d ) model to create random RCC-8 constrat graphs of order n, with an average verte degree d, with an average sie of relation per constrat l (which defaults to B /2 for model BA(n, m, r d )), and with r d % of distributive relations. We generated a total of 400 RCC-8 networks; more specifically, we considered 10 satisfiable and 10 unsatisfiable RCC-8 networks for each of the models BA(n = , m = 2, r d ) and A(n = 1 000, d = 10.0, l = 4.0, r d ), and for all values of r d rangg from 0% to 90% with a step of 10%. Regardg distributive relations particular, we considered the distributive subclass D8 64 of RCC-8 [Li et al., 2015] as our selection pool and as an put to algorithm PWC α. Satisfiability or otherwise of our networks was guaranteed by the generic qualitative constrat-based reasoner GQR [Gantner et al., 2008; Westphal et al., 2009]. Fally, the maimum cardality search algorithm [Tarjan and Yannakakis, 1984] was used to obta a variable elimation orderg α of a given QCN N for PWC α, and a triangulation G of the constrat graph of N based on α for both PWC α and PWC. We note that, with respect to our evaluation, any perfect elimation ordergs and, hence, any respective chordal graphs would have been adequate, as they would have affected all volved algorithms proportionally and would not have qualitatively distorted the obtaed results. An overview of the use of chordal graphs the QSTR literature is presented [Sioutis et al., 2016c]. Our evaluation volved two measures, which we describe as follows. The first measure considers the number of constrat checks performed by an algorithm for enforcg partial -consistency. Given a QCN N = (V, C) and three variables v i, v k, v j V, a constrat check occurs when we compute the relation r = C(v i, v j ) (C(v i, v k ) C(v k, v j )) and check if r C(v i, v j ), so that we can propagate its constraedness if that condition is satisfied. The second measure concerns the CPU time and is strongly correlated with the first one, as the run-time of any proper implementation of an algorithm for enforcg partial -consistency should rely maly on the number of constrat checks performed. Results. The eperimental results for random RCC-8 networks of models BA(n, m, r d ) and A(n, d, l, r d ) are presented Tables 1a and 1b respectively, where a fraction y denotes that an approach required seconds of CPU time and performed y constrat checks on average per dataset of networks durg its operation. Regardg satisfiable networks, despite a rather sluggish performance of PWC α when 0% of distributive relations were considered, terms of beg around 20% slower on average than PWC, it caught up fast, at around 20% of distributive relations, and constantly outperformed PWC from that pot on, beg nearly 80% faster on average than PWC when 90% of distributive relations were 1266
6 Table 1: Evaluation of the performance of algorithms PWC and PWC α (a) Evaluation with random scale-free RCC-8 networks of model BA(n = , m = 2, r d ) m average µ ma standard deviation σ SAT UNSAT SAT UNSAT SAT UNSAT SAT UNSAT r d PWC PWC α PWC PWC α PWC PWC α PWC PWC α PWC PWC α PWC PWC α PWC PWC α PWC PWC α 0% 9.6s s s s s 6 2.6s 1 5.8s 3 1.8s 1.8s 10% s s s s s 50k 2 7.2s 38k 20% 13.4s 28k 13.4s s 48k 16.2s 5 10k s s 9 9.8s s 1 2.8s 1 30% 17.6s 38k 15.7s 48k s k 2.6s 34.6s s 3 7.5s 4 4.7s 30k 2 1.8s % 18.4s s s s s s 5 4.1s 2 3.6s 2 4.4s 1 3.6s 50% 15.9s s s s s s 28k 1 60% 22.4s 70k 14.4s s s s s s 8 58k 1.5s % 25.6s s s s s s 4 8.7s 7 4.8s % 26.5s s s s s 128k 2 28k 1.5s % s s s 8 (b) Evaluation with random (unstructured) RCC-8 networks of model A(n = 1 000, d = 10.0, l = 4.0, r d ) s 11 10k 5.7s 60k 700 m average µ ma standard deviation σ SAT UNSAT SAT UNSAT SAT UNSAT SAT UNSAT r d PWC PWC α PWC PWC α PWC PWC α PWC PWC α PWC PWC α PWC PWC α PWC PWC α PWC PWC α 0% 3.2s 4.0s s 3.4s 1 1 8k 1 1 8k % 3.8s 1 4.0s s s % 3.9s 4.1s s 2 4.4s 2 4.6s % 4.7s 2 4.3s s 2 5.4s 3 4.9s 3 1.7s 1 40% 4.9s 30k s 3 4.6s 3 6.1s 4 38k 1 50% 5.9s 4 4.3s s 5 4.7s 3 7.4s 6 5.6s % 6.7s s s 7 5.3s 5 10k 70% 7.6s 6 3.8s s s 8 1.5s k 80% 8.0s 78k 3.4s k s s 80k % 8.3s 7 2.3s k 14.8s 250k 110k 1 1.9s considered. The same trend held true, more or less, for unsatisfiable networks, with the addition that the mimum time for refutg unsatisfiable networks for PWC α was often significantly less than that of PWC, which is eplaed by the fact that PWC α may generally detect certa consistencies at an earlier stage (see les 5 and 9 Algorithm 1). 5 Conclusion and Future Work Partial -consistency is an essential local consistency for tacklg fundamental reasong problems associated with qualitative constrat networks (QCNs), such as the problems of satisfiability checkg, mimal labelg, and redundancy. We proposed a new algorithm for efficiently applyg partial -consistency on arbitrary QCNs, that eploits the notion of abstraction for QCNs, utilies certa properties of partial -consistency, and adapts the functionalities of some state-of-the-art algorithms to its design. The evaluation that we conducted with QCNs of the Region Connection Calculus showed the usefulness and efficiency of our method. For future work, we would like to obta a variation of our algorithm for efficiently enforcg sgleton partial -consistency (i.e., partial -consistency [Amanedde et al., 2013]) on arbitrary QCNs, which is an important local consistency for solvg the mimal labelg problem, particular, of QCNs. 1267
7 References [Allen, 1983] James F. Allen. Matag Knowledge about Temporal Intervals. Commun. ACM, 26: , [Amanedde et al., 2013] Nouhad Amanedde, Jean- François Condotta, and Michael Sioutis. Efficient Approach to Solve the Mimal Labelg Problem of Temporal and Spatial Qualitative Constrats. In IJCAI, [Balbiani et al., 2002] Philippe Balbiani, Jean-François Condotta, and Luis Fariñas del Cerro. Tractability Results the Block Algebra. J. Log. Comput., 12: , [Barabasi and Albert, 1999] A.-L. Barabasi and R. Albert. Emergence of scalg random networks. Science, 286: , [Bhatt et al., 2011] Mehul Bhatt, Hans W. Guesgen, Stefan Wölfl, and Shyamanta Moni Haarika. Qualitative Spatial and Temporal Reasong: Emergg Applications, Trends, and Directions. Spatial Cognition & Computation, 11:1 14, [Chmeiss and Condotta, 2011] Assef Chmeiss and Jean- Francois Condotta. Consistency of Triangulated Temporal Qualitative Constrat Networks. In ICTAI, [Cousot and Cousot, 1992] Patrick Cousot and Radhia Cousot. Abstract Interpretation Frameworks. J. Log. Comput., 2: , [Dylla et al., 2013] Frank Dylla, Till Mossakowski, Thomas Schneider, and Diedrich Wolter. Algebraic Properties of Qualitative Spatio-Temporal Calculi. In COSIT, [Frank, 1991] Andrew U. Frank. Qualitative Spatial Reasong with Cardal Directions. In ÖGAI, [Gantner et al., 2008] Zeno Gantner, Matthias Westphal, and Stefan Wölfl. GQR-A Fast Reasoner for Bary Qualitative Constrat Calculi. In AAAI Workshop on Spatial and Temporal Reasong, [Gerevi, 2005] Alfonso Gerevi. Incremental qualitative temporal reasong: Algorithms for the pot algebra and the ord-horn class. Artif. Intell., 166(1-2):37 80, [Golumbic and Shamir, 1993] Mart Charles Golumbic and Ron Shamir. Compleity and Algorithms for Reasong about Time: A Graph-Theoretic Approach. J. ACM, 40: , [Huang, 2012] Jbo Huang. Compactness and its implications for qualitative spatial and temporal reasong. In KR, [Li et al., 2015] Sanjiang Li, Zhiguo Long, Weimg Liu, Matt Duckham, and Alan Both. On redundant topological constrats. Artif. Intell., 225:51 76, [Ligoat and Ren, 2004] Gérard Ligoat and Jochen Ren. What Is a Qualitative Calculus? A General Framework. In PRICAI, [Ligoat, 1998] Gerard Ligoat. Reasong about cardal directions. J. Vis. Lang. Comput., 9:23 44, [Long and Li, 2015] Zhiguo Long and Sanjiang Li. On Distributive Subalgebras of Qualitative Spatial and Temporal Calculi. In COSIT, [Long et al., 2016] Zhiguo Long, Michael Sioutis, and Sanjiang Li. Efficient Path Consistency Algorithm for Large Qualitative Constrat Networks. In IJCAI, [Nebel, 1997] Bernhard Nebel. Solvg Hard Qualitative Temporal Reasong Problems: Evaluatg the Efficiency of Usg the ORD-Horn Class. Constrats, 1: , [Randell et al., 1992] David A. Randell, Zhan Cui, and Anthony Cohn. A Spatial Logic Based on Regions & Connection. In KR, [Ren and Ligoat, 2005] Jochen Ren and Gérard Ligoat. Weak Composition for Qualitative Spatial and Temporal Reasong. In CP, [Ren and Nebel, 2001] Jochen Ren and Bernhard Nebel. Efficient Methods for Qualitative Spatial Reasong. J. Artif. Intell. Res., 15: , [Ren and Nebel, 2007] Jochen Ren and Bernhard Nebel. Qualitative Spatial Reasong Usg Constrat Calculi. In Handbook of Spatial Logics, pages [Ren, 2002] Jochen Ren. A Canonical Model of the Region Connection Calculus. J. Appl. Non-Classical Logics, 12: , [Sioutis et al., 2015] Michael Sioutis, Sanjiang Li, and Jean- François Condotta. Efficiently Characterig Non- Redundant Constrats Large Real World Qualitative Spatial Networks. In IJCAI, [Sioutis et al., 2016a] M. Sioutis, Z. Long, and S. Li. Efficiently Reasong about Qualitative Constrats through Variable Elimation. In SETN, [Sioutis et al., 2016b] Michael Sioutis, Jean-François Condotta, and Manolis Koubarakis. An Efficient Approach for Tacklg Large Real World Qualitative Spatial Networks. Int. J. Artif. Intell. Tools, 25:1 33, [Sioutis et al., 2016c] Michael Sioutis, Yakoub Salhi, and Jean-François Condotta. Studyg the use and effect of graph decomposition qualitative spatial and temporal reasong. Knowl. Eng. Rev., 32:e4, [Tarjan and Yannakakis, 1984] R. E. Tarjan and M. Yannakakis. Simple Lear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. SIAM J. Comput., 13: , [Tarski, 1941] Alfred Tarski. On the calculus of relations. J. Symb. Log., 6:73 89, [Vila and Kaut, 1986] Marc B. Vila and Henry A. Kaut. Constrat Propagation Algorithms for Temporal Reasong. In AAAI, [Westphal et al., 2009] Matthias Westphal, Stefan Wölfl, and Zeno Gantner. GQR: A Fast Solver for Bary Qualitative Constrat Networks. In AAAI Sprg Symposium on Benchmarkg of QSTR Systems,
Efficient Approach to Solve the Minimal Labeling Problem of Temporal and Spatial Qualitative Constraints
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence Efficient Approach to Solve the Minimal Labeling Problem of Temporal and Spatial Qualitative Constraints Nouhad
More informationOn Redundancy in Linked Geospatial Data
On Redundancy in Linked Geospatial Data Michael Sioutis 1, Sanjiang Li 2, and Jean-François Condotta 1 1 CRIL CNRS UMR 8188, Université d Artois, Lens, France {sioutis,condotta}@cril.fr 2 QCIS, University
More informationA Framework for Merging Qualitative Constraints Networks
Proceedings of the Twenty-First International FLAIRS Conference (2008) A Framework for Merging Qualitative Constraints Networks Jean-François Condotta, Souhila Kaci and Nicolas Schwind Université Lille-Nord
More informationCombining binary constraint networks in qualitative reasoning
Combining binary constraint networks in qualitative reasoning Jason Jingshi Li 1,2 and Tomasz Kowalski 1 and Jochen Renz 1,2 and Sanjiang Li 3 Abstract. Constraint networks in qualitative spatial and temporal
More informationReasoning with Cardinal Directions: An Efficient Algorithm
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (2008) Reasoning with Cardinal Directions: An Efficient Algorithm Xiaotong Zhang and Weiming Liu and Sanjiang Li and Mingsheng
More informationDisjunctive Temporal Reasoning in Partially Ordered Models of Time
From: AAAI-00 Proceedings Copyright 2000, AAAI (wwwaaaiorg) All rights reserved Disjunctive Temporal Reasoning in Partially Ordered Models of Time Mathias Broxvall and Peter Jonsson Department of Computer
More informationA Spatial Odyssey of the Interval Algebra: 1. Directed Intervals
To appear in: Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI 01), Seattle, WA, August 2001. A Spatial Odyssey of the Interval Algebra: 1. Directed Intervals Jochen
More informationarxiv: v2 [cs.ai] 13 Feb 2015
On Redundant Topological Constraints Sanjiang Li a,, Zhiguo Long a, Weiming Liu b, Matt Duckham c, Alan Both c a Centre for Quantum Computation & Intelligent Systems, University of Technology Sydney b
More informationWeak Composition for Qualitative Spatial and Temporal Reasoning
Weak Composition for Qualitative Spatial and Temporal Reasoning Jochen Renz 1 and Gérard Ligozat 2 1 National ICT Australia, Knowledge Representation and Reasoning Group UNSW Sydney, NSW 2052, Australia
More informationA Method for Generating All the Prime Implicants of Binary CNF Formulas
A Method for Generating All the Prime Implicants of Binary CNF Formulas Yakoub Salhi CRIL-CNRS, Université d Artois, F-62307 Lens Cedex, France salhi@cril.fr Abstract In this paper, we propose a method
More informationOn minimal models of the Region Connection Calculus
Fundamenta Informaticae 69 (2006) 1 20 1 IOS Press On minimal models of the Region Connection Calculus Lirong Xia State Key Laboratory of Intelligent Technology and Systems Department of Computer Science
More informationA new tractable subclass of the rectangle algebra
A new tractable subclass of the rectangle algebra P. Balbiani Laboratoire d'informatique de Paris-Nord Avenue J.-B. Clement F-93430 Villetaneuse, France balbiani@lipn.univ-parisl3.fr J.-F. Condotta, L.
More informationRough Sets Used in the Measurement of Similarity of Mixed Mode Data
Rough Sets Used the Measurement of Similarity of Mixed Mode Data Sarah Coppock Lawrence Mazlack Applied Artificial Intelligence Laboratory ECECS Department University of Ccnati Ccnati Ohio 45220 {coppocsmazlack}@ucedu
More information2009 AAAI Spring Symposium. Benchmarking of Qualitative Spatial and Temporal Reasoning Systems
2009 AAAI Spring Symposium Benchmarking of Qualitative Spatial and Temporal Reasoning Systems Stanford University March 23-25, 2009 Organizing Committee Bernhard Nebel (University of Freiburg, DE) Anthony
More informationRelations Between Spatial Calculi About Directions and Orientations (Extended Abstract 1 )
Relations Between Spatial Calculi About Directions and Orientations (Extended Abstract 1 ) Till Mossakowski 1, Reinhard Moratz 2 1 Otto-von-Guericke-University of Magdeburg, Germany 2 University of Maine,
More informationCombining Topological and Directional Information for Spatial Reasoning
Combining Topological and Directional Information for Spatial Reasoning Sanjiang Li Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China Institut für Informatik, Albert-Ludwigs-Universität
More informationarxiv: v1 [cs.ai] 1 Jun 2016
A A Survey of Qualitative Spatial and Temporal Calculi Algebraic and Computational Properties FRANK DYLLA, University of Bremen JAE HEE LEE, University of Bremen TILL MOSSAKOWSKI, University of Magdeburg
More informationarxiv: v1 [cs.ai] 31 May 2013
Algebraic Properties of Qualitative Spatio-Temporal Calculi Frank Dylla 1, Till Mossakowski 1,2, Thomas Schneider 3, and Diedrich Wolter 1 1 Collaborative Research Center on Spatial Cognition (SFB/TR 8),
More informationA Resolution Method for Modal Logic S5
EPiC Series in Computer Science Volume 36, 2015, Pages 252 262 GCAI 2015. Global Conference on Artificial Intelligence A Resolution Method for Modal Logic S5 Yakoub Salhi and Michael Sioutis Université
More informationOn the Propagation Strength of SAT Encodings for Qualitative Temporal Reasoning
On the Propagation Strength of SAT Encodings for Qualitative Temporal Reasoning Matthias Westphal, Julien Hué, Stefan Wölfl Department of Computer Science, University of Freiburg Georges-Köhler-Allee,
More informationEncoding formulas with partially constrained weights in a possibilistic-like many-sorted propositional logic
Encoding formulas with partially constrained weights in a possibilistic-like many-sorted propositional logic Salem Benferhat CRIL-CNRS, Université d Artois rue Jean Souvraz 62307 Lens Cedex France benferhat@criluniv-artoisfr
More informationLINEAR COMPARTMENTAL MODELS: INPUT-OUTPUT EQUATIONS AND OPERATIONS THAT PRESERVE IDENTIFIABILITY. 1. Introduction
LINEAR COMPARTMENTAL MODELS: INPUT-OUTPUT EQUATIONS AND OPERATIONS THAT PRESERVE IDENTIFIABILITY ELIZABETH GROSS, HEATHER HARRINGTON, NICOLETTE MESHKAT, AND ANNE SHIU Abstract. This work focuses on the
More informationarxiv: v2 [cs.ai] 13 Sep 2013
Algebraic Properties of Qualitative Spatio-Temporal Calculi Frank Dylla 1, Till Mossakowski 1,2, Thomas Schneider 3, and Diedrich Wolter 1 1 Collaborative Research Center on Spatial Cognition (SFB/TR 8),
More informationSpatio-Temporal Stream Reasoning with Incomplete Spatial Information
Spatio-Temporal Stream Reasoning with Incomplete Spatial Information Fredrik Heintz and Daniel de Leng IDA, Linköping University, Sweden Abstract. Reasoning about time and space is essential for many applications,
More informationA Class of Star-Algebras for Point-Based Qualitative Reasoning in Two- Dimensional Space
From: FLAIRS- Proceedings. Copyright AAAI (www.aaai.org). All rights reserved. A Class of Star-Algebras for Point-Based Qualitative Reasoning in Two- Dimensional Space Debasis Mitra Department of Computer
More informationarxiv: v1 [cs.ai] 1 Sep 2009
Reasoning about Cardinal Directions between Extended Objects arxiv:0909.0138v1 [cs.ai] 1 Sep 2009 Xiaotong Zhang, Weiming Liu, Sanjiang Li, Mingsheng Ying Centre for Quantum Computation and Intelligent
More informationBernhard Nebel, Julien Hué, and Stefan Wölfl. June 27 & July 2/4, 2012
Bernhard Nebel, Julien Hué, and Stefan Wölfl Albert-Ludwigs-Universität Freiburg June 27 & July 2/4, 2012 vs. complexity For some restricted constraint languages we know some polynomial time algorithms
More informationQualitative Constraint Satisfaction Problems: Algorithms, Computational Complexity, and Extended Framework
Qualitative Constraint Satisfaction Problems: Algorithms, Computational Complexity, and Extended Framework Weiming Liu Faculty of Engineering and Information Technology University of Technology, Sydney
More informationApplied Logic. Lecture 1 - Propositional logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw
Applied Logic Lecture 1 - Propositional logic Marcin Szczuka Institute of Informatics, The University of Warsaw Monographic lecture, Spring semester 2017/2018 Marcin Szczuka (MIMUW) Applied Logic 2018
More informationCharacterization of Semantics for Argument Systems
Characterization of Semantics for Argument Systems Philippe Besnard and Sylvie Doutre IRIT Université Paul Sabatier 118, route de Narbonne 31062 Toulouse Cedex 4 France besnard, doutre}@irit.fr Abstract
More informationIncorporating uncertainty in the design of water distribution systems
European Water 58: 449-456, 2017. 2017 E.W. Publications Incorporatg uncertaty the design of water distribution systems M. Spiliotis 1* and G. Tsakiris 2 1 Division of Hydraulic Engeerg, Department of
More informationFrom Crisp to Fuzzy Constraint Networks
From Crisp to Fuzzy Constraint Networks Massimiliano Giacomin Università di Brescia Dipartimento di Elettronica per l Automazione Via Branze 38, I-25123 Brescia, Italy giacomin@ing.unibs.it Abstract. Several
More informationDismatching and Local Disunification in EL
Dismatching and Local Disunification in EL (Extended Abstract) Franz Baader, Stefan Borgwardt, and Barbara Morawska Theoretical Computer Science, TU Dresden, Germany {baader,stefborg,morawska}@tcs.inf.tu-dresden.de
More informationIncomplete Information in RDF
Incomplete Information in RDF Charalampos Nikolaou and Manolis Koubarakis charnik@di.uoa.gr koubarak@di.uoa.gr Department of Informatics and Telecommunications National and Kapodistrian University of Athens
More informationA A Survey of Qualitative Spatial and Temporal Calculi Algebraic and Computational Properties
A A Survey of Qualitative Spatial and Temporal Calculi Algebraic and Computational Properties FRANK DYLLA, University of Bremen JAE HEE LEE, University of Bremen TILL MOSSAKOWSKI, University of Magdeburg
More informationGeneralized Micro-Structures for Non-Binary CSP
Generalized Micro-Structures for Non-Binary CSP Achref El Mouelhi LSIS - UMR CNRS 7296 Aix-Marseille Université Avenue Escadrille Normandie-Niemen 13397 Marseille Cedex 20 (France) achref.elmouelhi@lsis.org
More informationCombining topological and size information for spatial reasoning
Artificial Intelligence 137 (2002) 1 42 www.elsevier.com/locate/artint Combining topological and size information for spatial reasoning Alfonso Gerevini a,, Jochen Renz b a Dipartimento di Elettronica
More informationImproved Algorithms for Module Extraction and Atomic Decomposition
Improved Algorithms for Module Extraction and Atomic Decomposition Dmitry Tsarkov tsarkov@cs.man.ac.uk School of Computer Science The University of Manchester Manchester, UK Abstract. In recent years modules
More informationA Generalized Framework for Reasoning with Angular Directions
A Generalized Framework for Reasoning with Angular Directions Debasis Mitra Department of Computer Sciences Florida Institute of Technology Melbourne, FL 3901, USA Tel. 31-674-7737, Fax: -7046, E-mail:
More informationOn the Gap between the Complexity of SAT and Minimization for Certain Classes of Boolean Formulas
On the Gap between the Complexity of SAT and Minimization for Certain Classes of Boolean Formulas Ondřej Čepek and Štefan Gurský Abstract It is a wellknown fact that the satisfiability problem (SAT) for
More informationCombining RCC5 Relations with Betweenness Information
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence Combining RCC5 Relations with Betweenness Information Steven Schockaert Cardiff University United Kingdom s.schockaert@cs.cardiff.ac.uk
More informationPropositional Logic Language
Propositional Logic Language A logic consists of: an alphabet A, a language L, i.e., a set of formulas, and a binary relation = between a set of formulas and a formula. An alphabet A consists of a finite
More informationFinding Stable Matchings That Are Robust to Errors in the Input
Fdg Stable Matchgs That Are Robust to Errors the Input Tung Mai Georgia Institute of Technology, Atlanta, GA, USA tung.mai@cc.gatech.edu Vijay V. Vazirani University of California, Irve, Irve, CA, USA
More informationInterface for module Ptset
Interface for module Ptset 1 1 Interface for module Ptset 1. Sets of tegers implemented as Patricia trees. The followg signature is exactly Set.S with type elt = t, with the same specifications. This is
More informationAdding ternary complex roles to ALCRP(D)
Adding ternary complex roles to ALCRP(D) A.Kaplunova, V. Haarslev, R.Möller University of Hamburg, Computer Science Department Vogt-Kölln-Str. 30, 22527 Hamburg, Germany Abstract The goal of this paper
More informationAlgebraic Tractability Criteria for Infinite-Domain Constraint Satisfaction Problems
Algebraic Tractability Criteria for Infinite-Domain Constraint Satisfaction Problems Manuel Bodirsky Institut für Informatik Humboldt-Universität zu Berlin May 2007 CSPs over infinite domains (May 2007)
More informationTopological Logics over Euclidean Spaces
Topological Logics over Euclidean Spaces Roman Kontchakov Department of Computer Science and Inf Systems, Birkbeck College, London http://wwwdcsbbkacuk/~roman joint work with Ian Pratt-Hartmann and Michael
More informationSyntactic Conditions for Antichain Property in CR-Prolog
This version: 2017/05/21 Revising my paper before submitting for publication. Syntactic Conditions for Antichain Property in CR-Prolog Vu Phan Texas Tech University Abstract We study syntactic conditions
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 7. Propositional Logic Rational Thinking, Logic, Resolution Joschka Boedecker and Wolfram Burgard and Bernhard Nebel Albert-Ludwigs-Universität Freiburg May 17, 2016
More informationFormal Epistemology: Lecture Notes. Horacio Arló-Costa Carnegie Mellon University
Formal Epistemology: Lecture Notes Horacio Arló-Costa Carnegie Mellon University hcosta@andrew.cmu.edu Logical preliminaries Let L 0 be a language containing a complete set of Boolean connectives, including
More informationConvex Hull-Based Metric Refinements for Topological Spatial Relations
ABSTRACT Convex Hull-Based Metric Refinements for Topological Spatial Relations Fuyu (Frank) Xu School of Computing and Information Science University of Maine Orono, ME 04469-5711, USA fuyu.xu@maine.edu
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 8. Satisfiability and Model Construction Davis-Putnam-Logemann-Loveland Procedure, Phase Transitions, GSAT Joschka Boedecker and Wolfram Burgard and Bernhard Nebel
More informationPairing Transitive Closure and Reduction to Efficiently Reason about Partially Ordered Events
Pairing Transitive Closure and Reduction to Efficiently Reason about Partially Ordered Events Massimo Franceschet Angelo Montanari Dipartimento di Matematica e Informatica, Università di Udine Via delle
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 7. Propositional Logic Rational Thinking, Logic, Resolution Joschka Boedecker and Wolfram Burgard and Frank Hutter and Bernhard Nebel Albert-Ludwigs-Universität Freiburg
More informationallows a simple representation where regions are reduced to their important points and information about the neighborhood of these points [Ren98]. Mos
Spatial Cognition - An interdisciplinary approach to representation and processing of spatial knowledge, Springer-Verlag, Berlin. Spatial Reasoning with Topological Information Jochen Renz and Bernhard
More informationValue Range Propagation
Value Range Propagation LLVM Adam Wiggs Patryk Zadarnowski {awiggs,patrykz}@cse.unsw.edu.au 17 June 2003 University of New South Wales Sydney MOTIVATION The Problem: X Layout of basic blocks LLVM is bra-dead.
More informationAn Algebra of Granular Temporal Relations for Qualitative Reasoning
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015) An Algebra of Granular Temporal Relations for Qualitative Reasoning Quentin Cohen-Solal and Maroua
More informationPairing Transitive Closure and Reduction to Efficiently Reason about Partially Ordered Events
Pairing Transitive Closure and Reduction to Efficiently Reason about Partially Ordered Events Massimo Franceschet Angelo Montanari Dipartimento di Matematica e Informatica, Università di Udine Via delle
More informationThe complexity of acyclic subhypergraph problems
The complexity of acyclic subhypergraph problems David Duris and Yann Strozecki Équipe de Logique Mathématique (FRE 3233) - Université Paris Diderot-Paris 7 {duris,strozecki}@logique.jussieu.fr Abstract.
More informationMANUEL BODIRSKY AND JAN KÁRA
A FAST ALGORITHM AND DATALOG INEXPRESSIBILITY FOR TEMPORAL REASONING arxiv:0805.1473v2 [cs.ai] 11 Apr 2009 MANUEL BODIRSKY AND JAN KÁRA Humboldt-Universität zu Berlin, Germany E-mail address: bodirsky@informatik.hu-berlin.de
More informationEXTENDED MEREOTOPOLOGY BASED ON SEQUENT ALGEBRAS: Mereotopological representation of Scott and Tarski consequence relations
EXTENDED MEREOTOPOLOGY BASED ON SEQUENT ALGEBRAS: Mereotopological representation of Scott and Tarski consequence relations Dimiter Vakarelov Department of mathematical logic, Faculty of mathematics and
More informationEntailment with Conditional Equality Constraints (Extended Version)
Entailment with Conditional Equality Constraints (Extended Version) Zhendong Su Alexander Aiken Report No. UCB/CSD-00-1113 October 2000 Computer Science Division (EECS) University of California Berkeley,
More informationarxiv: v1 [cs.dm] 29 Oct 2012
arxiv:1210.7684v1 [cs.dm] 29 Oct 2012 Square-Root Finding Problem In Graphs, A Complete Dichotomy Theorem. Babak Farzad 1 and Majid Karimi 2 Department of Mathematics Brock University, St. Catharines,
More informationClosure operators on sets and algebraic lattices
Closure operators on sets and algebraic lattices Sergiu Rudeanu University of Bucharest Romania Closure operators are abundant in mathematics; here are a few examples. Given an algebraic structure, such
More informationA Discrete Duality Between Nonmonotonic Consequence Relations and Convex Geometries
A Discrete Duality Between Nonmonotonic Consequence Relations and Convex Geometries Johannes Marti and Riccardo Pinosio Draft from April 5, 2018 Abstract In this paper we present a duality between nonmonotonic
More informationMATHEMATICAL ENGINEERING TECHNICAL REPORTS. Deductive Inference for the Interiors and Exteriors of Horn Theories
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Deductive Inference for the Interiors and Exteriors of Horn Theories Kazuhisa MAKINO and Hirotaka ONO METR 2007 06 February 2007 DEPARTMENT OF MATHEMATICAL INFORMATICS
More informationPrinciples of Knowledge Representation and Reasoning
Principles of Knowledge Representation and Reasoning Modal Logics Bernhard Nebel, Malte Helmert and Stefan Wölfl Albert-Ludwigs-Universität Freiburg May 2 & 6, 2008 Nebel, Helmert, Wölfl (Uni Freiburg)
More informationLecture notes 1: ECEN 489
Lecture notes : ECEN 489 Power Management Circuits and Systems Department of Electrical & Computer Engeerg Texas A&M University Jose Silva-Martez January 207 Copyright Texas A&M University. All rights
More informationDeterministic Decentralized Search in Random Graphs
Deterministic Decentralized Search in Random Graphs Esteban Arcaute 1,, Ning Chen 2,, Ravi Kumar 3, David Liben-Nowell 4,, Mohammad Mahdian 3, Hamid Nazerzadeh 1,, and Ying Xu 1, 1 Stanford University.
More informationDecision Procedures for Satisfiability and Validity in Propositional Logic
Decision Procedures for Satisfiability and Validity in Propositional Logic Meghdad Ghari Institute for Research in Fundamental Sciences (IPM) School of Mathematics-Isfahan Branch Logic Group http://math.ipm.ac.ir/isfahan/logic-group.htm
More information7. Propositional Logic. Wolfram Burgard and Bernhard Nebel
Foundations of AI 7. Propositional Logic Rational Thinking, Logic, Resolution Wolfram Burgard and Bernhard Nebel Contents Agents that think rationally The wumpus world Propositional logic: syntax and semantics
More informationInduced Subgraph Isomorphism on proper interval and bipartite permutation graphs
Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs Pinar Heggernes Pim van t Hof Daniel Meister Yngve Villanger Abstract Given two graphs G and H as input, the Induced Subgraph
More informationElementary Sets for Logic Programs
Elementary Sets for Logic Programs Martin Gebser Institut für Informatik Universität Potsdam, Germany Joohyung Lee Computer Science and Engineering Arizona State University, USA Yuliya Lierler Department
More informationThe computational complexity of dominance and consistency in CP-nets
The computational complexity of dominance and consistency in CP-nets Judy Goldsmith Dept. of Comp. Sci. University of Kentucky Lexington, KY 40506-0046, USA goldsmit@cs.uky.edu Abstract Jérôme Lang IRIT
More informationElementary Loops Revisited
Elementary Loops Revisited Jianmin Ji a, Hai Wan b, Peng Xiao b, Ziwei Huo b, and Zhanhao Xiao c a School of Computer Science and Technology, University of Science and Technology of China, Hefei, China
More informationWorst-Case Upper Bound for (1, 2)-QSAT
Worst-Case Upper Bound for (1, 2)-QSAT Minghao Yin Department of Computer, Northeast Normal University, Changchun, China, 130117 ymh@nenu.edu.cn Abstract. The rigorous theoretical analysis of the algorithm
More informationSearch and Lookahead. Bernhard Nebel, Julien Hué, and Stefan Wölfl. June 4/6, 2012
Search and Lookahead Bernhard Nebel, Julien Hué, and Stefan Wölfl Albert-Ludwigs-Universität Freiburg June 4/6, 2012 Search and Lookahead Enforcing consistency is one way of solving constraint networks:
More informationOn Terminological Default Reasoning about Spatial Information: Extended Abstract
On Terminological Default Reasoning about Spatial Information: Extended Abstract V. Haarslev, R. Möller, A.-Y. Turhan, and M. Wessel University of Hamburg, Computer Science Department Vogt-Kölln-Str. 30,
More informationEquational Logic. Chapter Syntax Terms and Term Algebras
Chapter 2 Equational Logic 2.1 Syntax 2.1.1 Terms and Term Algebras The natural logic of algebra is equational logic, whose propositions are universally quantified identities between terms built up from
More informationElementary Sets for Logic Programs
Elementary Sets for Logic Programs Martin Gebser Institut für Informatik Universität Potsdam, Germany Joohyung Lee Computer Science and Engineering Arizona State University, USA Yuliya Lierler Department
More informationLoop Formulas for Circumscription
Loop Formulas for Circumscription Joohyung Lee Department of Computer Sciences University of Texas, Austin, TX, USA appsmurf@cs.utexas.edu Fangzhen Lin Department of Computer Science Hong Kong University
More informationPrinciples of Knowledge Representation and Reasoning
Principles of Knowledge Representation and Reasoning Complexity Theory Bernhard Nebel, Malte Helmert and Stefan Wölfl Albert-Ludwigs-Universität Freiburg April 29, 2008 Nebel, Helmert, Wölfl (Uni Freiburg)
More informationTrichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs
Trichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs Mirosław Truszczyński Department of Computer Science, University of Kentucky, Lexington, KY 40506, USA Abstract. We present
More informationEndre Boros a Ondřej Čepekb Alexander Kogan c Petr Kučera d
R u t c o r Research R e p o r t A subclass of Horn CNFs optimally compressible in polynomial time. Endre Boros a Ondřej Čepekb Alexander Kogan c Petr Kučera d RRR 11-2009, June 2009 RUTCOR Rutgers Center
More information1.2 Valid Logical Equivalences as Tautologies
1.2. VALID LOGICAL EUIVALENCES AS TAUTOLOGIES 15 1.2 Valid Logical Equivalences as Tautologies 1.2.1 The Idea, and Defition, of Logical Equivalence In lay terms, two statements are logically equivalent
More informationIntelligent GIS: Automatic generation of qualitative spatial information
Intelligent GIS: Automatic generation of qualitative spatial information Jimmy A. Lee 1 and Jane Brennan 1 1 University of Technology, Sydney, FIT, P.O. Box 123, Broadway NSW 2007, Australia janeb@it.uts.edu.au
More informationComputing Loops With at Most One External Support Rule
Computing Loops With at Most One External Support Rule Xiaoping Chen and Jianmin Ji University of Science and Technology of China P. R. China xpchen@ustc.edu.cn, jizheng@mail.ustc.edu.cn Fangzhen Lin Department
More informationKnowledge Compilation and Theory Approximation. Henry Kautz and Bart Selman Presented by Kelvin Ku
Knowledge Compilation and Theory Approximation Henry Kautz and Bart Selman Presented by Kelvin Ku kelvin@cs.toronto.edu 1 Overview Problem Approach Horn Theory and Approximation Computing Horn Approximations
More informationRepresentability in DL-Lite R Knowledge Base Exchange
epresentability in DL-Lite Knowledge Base Exchange M. Arenas 1, E. Botoeva 2, D. Calvanese 2, V. yzhikov 2, and E. Sherkhonov 3 1 Dept. of Computer Science, PUC Chile marenas@ing.puc.cl 2 KDB esearch Centre,
More informationAn Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints Khalil Djelloul Laboratoire d Informatique Fondamentale d Orléans. Bat. 3IA, rue Léonard de Vinci. 45067 Orléans,
More information4-coloring P 6 -free graphs with no induced 5-cycles
4-coloring P 6 -free graphs with no induced 5-cycles Maria Chudnovsky Department of Mathematics, Princeton University 68 Washington Rd, Princeton NJ 08544, USA mchudnov@math.princeton.edu Peter Maceli,
More informationInterleaved Alldifferent Constraints: CSP vs. SAT Approaches
Interleaved Alldifferent Constraints: CSP vs. SAT Approaches Frédéric Lardeux 3, Eric Monfroy 1,2, and Frédéric Saubion 3 1 Universidad Técnica Federico Santa María, Valparaíso, Chile 2 LINA, Université
More informationA Collection of Problems in Propositional Logic
A Collection of Problems in Propositional Logic Hans Kleine Büning SS 2016 Problem 1: SAT (respectively SAT) Instance: A propositional formula α (for SAT in CNF). Question: Is α satisfiable? The problems
More informationResolving Conflicts in Action Descriptions
Resolving Conflicts in Action Descriptions Thomas Eiter and Esra Erdem and Michael Fink and Ján Senko 1 Abstract. We study resolving conflicts between an action description and a set of conditions (possibly
More informationAdapting the DF-QuAD Algorithm to Bipolar Argumentation
Adapting the DF-QuAD Algorithm to Bipolar Argumentation Antonio RAGO a,1, Kristijonas ČYRAS a and Francesca TONI a a Department of Computing, Imperial College London, UK Abstract. We define a quantitative
More informationHow to Handle Incomplete Knowledge Concerning Moving Objects
B B is How to Handle Incomplete Knowledge Concerning Moving Objects Nico Van de Weghe 1, Peter Bogaert 1, Anthony G. Cohn 2, Matthias Delafontaine 1, Leen De Temmerman 1, Tijs Neutens 1, Philippe De Maeyer
More informationSubsumption of concepts in FL 0 for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete.
Subsumption of concepts in FL 0 for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete. Yevgeny Kazakov and Hans de Nivelle MPI für Informatik, Saarbrücken, Germany E-mail:
More informationGeneralizations of Matched CNF Formulas
Generalizations of Matched CNF Formulas Stefan Szeider (szeider@cs.toronto.edu) Department of Computer Science, University of Toronto, M5S 3G4 Toronto, Ontario, Canada Abstract. A CNF formula is called
More informationBasing Decisions on Sentences in Decision Diagrams
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence Basing Decisions on Sentences in Decision Diagrams Yexiang Xue Department of Computer Science Cornell University yexiang@cs.cornell.edu
More informationReasoning in the Description Logic BEL using Bayesian Networks
Reasoning in the Description Logic BEL using Bayesian Networks İsmail İlkan Ceylan Theoretical Computer Science TU Dresden, Germany ceylan@tcs.inf.tu-dresden.de Rafael Peñaloza Theoretical Computer Science,
More information