## Logic for Programming, Artificial Intelligence, and Reasoning: 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008, ProceedingsIliano Cervesato, Helmut Veith, Andrei Voronkov This volume contains the papers presented at the 15th International Conference on Logic for Programming, Arti?cial Intelligence, and Reasoning (LPAR) held November22–27inDoha,QataronthepremisesoftheQatarcampusofCarnegie Mellon University. In its 15th edition, LPAR looked back at a rich history. The conference evolved out of the First and Second Russian Conferences on Logic Progr- ming, held in Irkutsk, in 1990, and aboard the ship “Michail Lomonosov” in 1991. The idea of organizing the conference came largely from Robert Kowalski, who also proposed the creation of the Russian Association for Logic Progr- ming. In 1992, it was decided to extend the scope of the conference. Due to considerableinterestinautomatedreasoningintheformerSovietUnion,thec- ference was renamed Logic Programming and Automated Reasoning (LPAR). Under this name three meetings were held during 1992–1994: again on board the ship “Michail Lomonosov” (1992), in St. Petersburg, Russia (1993), and on board the ship “Marshal Koshevoi” (1994). In 1999, the conference was held in Tbilisi, Georgia. At the suggestion of Michel Parigot,the conference changed its nameagaintoLogicforProgrammingandAutomatedReasoning(preservingthe acronym LPAR!) re?ecting an interest in additional areas of logic. LPAR 2000 was held on Reunion Island, France. In 2001, the name (but not the acronym) changed again to its current form. The 8th to the 14th meetings were held in the following locations: Havana, Cuba (2001) Tbilisi, Georgia (2002); Almaty, Kazakhstan(2003);Montevideo,Uruguay(2004);MontegoBay,Jamaica(2005); Phnom Penh, Cambodia (2006); and Yerevan, Armenia (2007). |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Other editions - View all

### Common terms and phrases

abstract algorithm applied arity assignment atomic automata automaton BC SLS Boolean bound calculus clause complexity Computer conjunction consider constraint construction contains context corresponding datalog deep inference deﬁned deﬁnition denote dependency pair derivation diﬀerent encoding equivalent example exists ExpTime extended ﬁnite ﬁrst ﬁrst-order ﬁxed formula function symbols given graph Heidelberg Heidelberg 2008 hierarchical module Horn clauses inﬁnite input instance integer intuitionistic logic language Lemma linear literal LNCS logic LPAR max-atoms MaxSAT minimal Modal Logics model checking module node obtain path polynomial positive predicate problem proof propositional protocol prove quantiﬁer query queue reachability relation rewrite rules satisﬁability satisfying semantics sequence sequent calculus solve solver Springer structure subset temporal termination Theorem theory transition tree tree automaton treewidth tuple unsatisﬁable values variables veriﬁcation XPath