Voronkov / Baaz | Logic for Programming, Artificial Intelligence, and Reasoning | Buch | 978-3-540-00010-5 | sack.de

Buch, Englisch, Band 2514, 470 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1490 g

Reihe: Lecture Notes in Computer Science

Voronkov / Baaz

Logic for Programming, Artificial Intelligence, and Reasoning

9th International Conference, LPAR 2002, Tbilisi, Georgia, October 14-18, 2002 Proceedings
2002
ISBN: 978-3-540-00010-5
Verlag: Springer Berlin Heidelberg

9th International Conference, LPAR 2002, Tbilisi, Georgia, October 14-18, 2002 Proceedings

Buch, Englisch, Band 2514, 470 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1490 g

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-540-00010-5
Verlag: Springer Berlin Heidelberg


MaurizioLenzerini(Universit`adiRoma“LaSapienza”) GiorgioLevi(Universit`adiPisa) LeonidLibkin(UniversityofToronto) RobertNieuwenhuis(TechnicalUniversityofCatalonia) LeszekPacholski(WroclawskiUniwersytet) MichelParigot(Universit´eParis7) PavelPudlak(MathematicalInstitute,Prague) CarstenSchuermann(YaleUniversity) J¨orgSiekmann(DFKISaarbruc ¨ken) WolfgangThomas(RWTHAachen) MichaelZakharyaschev(King’sCollege) LocalOrganization KhimuriRhukia KotePhakadze GelaChankvetadze JemalAntidze VIII ConferenceOrganization ListofReferees GianlucaAmato CarlosAreces M. Arenas OferArieli RobertoBarbuti ChristophBenzmueller MartaBilkova BrunoBlanchet AlexandreBoisseau AhmedBouajjani DmitriChubarov PabloCordero VeroniqueCortier AgostinoDovier RachidEchahed MorenoFalaschi C`esarFerri OlivierGasquet BernhardGramlich Jos´eManuelG´omez PhilippedeGroote RainerHaehnle JiriHanika JuanHeguiabehere JoseHernandez-Orallo ThomasHillenbrand JoeHurd EmilJerabek ValentinJijkoun KonstantinKorovin G. Lakemeyer DominiqueLarchey-Wendling OlivierLaurent StefanLeue LuigiLiquori ChristofLoeding CarstenLutz ChristopherLynch PatrickMaier PaoloMancarella FlorenceMaraninchi MaartenMarx Jesus ´ Medina EricaMelis AntoineMin´e RalfM¨oller PaulinDeNaurois HansdeNivelle MichaelNorrish ManuelOjeda-Aciego NikolayPelov GuyPerrier ReinhardPichler ChristopherPollett Germ´anPuebla Jean-PierreRessayre ChristianRetor´e AlexandreRiazanov MichalRossler PaulRozi`ere NikitaSakhanenko UlrikeSattler StefanSchlobach ManfredSchmidt-Schauß KonradSlind Anni-YasminTurhan ChristianUrban WimVanhoof YdeVenema So?eVerbaeten UweWaldmann KlausWeich ClausPeterWirth StefanWoehrle ConferenceOrganization IX ConferencesprecedingLPAR2001 RCLP’90,Irkutsk,SovietUnion RCLP’91,Leningrad,SovietUnion,aboardtheship“MichailLomonosov” LPAR’92,St. Petersburg,Russia,aboardtheship“MichailLomonosov” LPAR’93,St. Petersburg,Russia LPAR’94,Kiev,Ukraine,aboardtheship“MarshalKoshevoi” LPAR’99,Tbilisi,RepublicofGeorgia LPAR2000,ReunionIsland,France LPAR2001,Havana,Cuba TableofContents ImprovingOn-DemandStrategyAnnotations. 1 M. Alpuente,S. Escobar,B. Gramlich,S. Lucas First-OrderLogicasaConstraintProgrammingLanguage. 19 K. R. Apt,C. F. M. Vermeulen MaintenanceofFormalSoftwareDevelopmentsby Strati?edVeri?cation. 36 SergeAutexier,DieterHutter ANoteonUniversalMeasuresforWeakImplicit ComputationalComplexity. 53 ArnoldBeckmann ExtendingCompositionalMessageSequenceGraphs. 68 BenediktBollig,MartinLeucker,PhilippLucas SearchingforInvariantsUsingTemporalResolution. 86 JamesBrotherston,AnatoliDegtyarev,MichaelFisher, AlexeiLisitsa ProofPlanningforFeatureInteractions:APreliminaryReport. 102 ClaudioCastellini,AlanSmaill AnExtensionofBDI withFunctional CTL DependenciesandComponents. 115 MehdiDastani,LeendertvanderTorre BindingLogic:ProofsandModels. 130 GillesDowek,Th´er`eseHardin,ClaudeKirchner DirectedAutomatedTheoremProving. 145 StefanEdelkamp,PeterLeven AFrameworkforSplittingBDIAgents. 160 XiaocongFan,JohnYen OntheComplexityofDisjunctionandExplicitDe?nability PropertiesinSomeIntermediateLogics. 175 MauroFerrari,CamilloFiorentini,GuidoFiorino UsingBDDswithCombinationsofTheories. 190 PascalFontaine,E. PascalGribomont XII TableofContents OnExpressiveDescriptionLogicswithCompositionofRolesin NumberRestrictions. 202 FabioGrandi QueryOptimizationofDisjunctiveDatabaseswithConstraints throughBindingPropagation. 216 GianluigiGreco,SergioGreco,IrinaTrubtsyna,EsterZumpano ANon-commutativeExtensionofMELL. 231 AlessioGuglielmi,LutzStraßburger ProceduralSemanticsforFuzzyDisjunctivePrograms. 247 Du?sanGuller PushdownSpeci?cations. 262 OrnaKupferman,NirPiterman,MosheY. Vardi TheoremProvingwithSequenceVariablesandFlexible AritySymbols.

Voronkov / Baaz Logic for Programming, Artificial Intelligence, and Reasoning jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Improving On-Demand Strategy Annotations.- First-Order Logic as a Constraint Programming Language.- Maintenance of Formal Software Developments by Stratified Verification.- A Note on Universal Measures for Weak Implicit Computational Complexity.- Extending Compositional Message Sequence Graphs.- Searching for Invariants Using Temporal Resolution.- Proof Planning for Feature Interactions: A Preliminary Report.- An Extension of BDICTL with Functional Dependencies and Components.- Binding Logic: Proofs and Models.- Directed Automated Theorem Proving.- A Framework for Splitting BDI Agents.- On the Complexity of Disjunction and Explicit Definability Properties in Some Intermediate Logics.- Using BDDs with Combinations of Theories.- On Expressive Description Logics with Composition of Roles in Number Restrictions.- Query Optimization of Disjunctive Databases with Constraints through Binding Propagation.- A Non-commutative Extension of MELL.- Procedural Semantics for Fuzzy Disjunctive Programs.- Pushdown Specifications.- Theorem Proving with Sequence Variables and Flexible Arity Symbols.- Games, Probability, and the Quantitative ?-Calculus qM?.- Parallelism and Tree Regular Constraints.- Gödel Logics and Cantor-Bendixon Analysis.- A Semantics for Proof Plans with Applications to Interactive Proof Planning.- An Isomorphism between a Fragment of Sequent Calculus and an Extension of Natural Deduction.- Proof Development with ?MEGA: ?2 Is Irrational.- A Local System for Linear Logic.- Investigating Type-Certifying Compilation with Isabelle.- Automating Type Soundness Proofs via Decision Procedures and Guided Reductions.- Abox Satisfiability Reduced to Terminological Reasoning in Expressive Description Logics.- Fuzzy Prolog: A Simple General Implementation Using (R).



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.