000 04266nam a22006255i 4500
001 978-3-642-04222-5
003 DE-He213
005 20240423125729.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 _a9783642042225
_9978-3-642-04222-5
024 7 _a10.1007/978-3-642-04222-5
_2doi
050 4 _aQ334-342
050 4 _aTA347.A78
072 7 _aUYQ
_2bicssc
072 7 _aCOM004000
_2bisacsh
072 7 _aUYQ
_2thema
082 0 4 _a006.3
_223
245 1 0 _aFrontiers of Combining Systems
_h[electronic resource] :
_b7th International Symposium, FroCoS 2009, Trento, Italy, September 16-18, 2009, Proceedings /
_cedited by Silvio Ghilardi, Roberto Sebastiani.
250 _a1st ed. 2009.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2009.
300 _aX, 383 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v5749
505 0 _aInvited Talks -- Building SMT-Based Software Model Checkers: An Experience Report -- Combining Nonmonotonic Knowledge Bases with External Sources -- Combining Description Logics, Description Graphs, and Rules -- Combining Equational Reasoning -- Technical Papers -- Superposition Modulo Linear Arithmetic SUP(LA) -- Unification Modulo Homomorphic Encryption -- Argument Filterings and Usable Rules for Simply Typed Dependency Pairs -- DL-Lite with Temporalised Concepts, Rigid Axioms and Roles -- Runtime Verification Using a Temporal Description Logic -- Axiomatization and Completeness of Lexicographic Products of Modal Logics -- Automating Theories in Intuitionistic Logic -- Taming the Complexity of Temporal Epistemic Reasoning -- Putting ABox Updates into Action -- A Declarative Agent Programming Language Based on Action Theories -- Termination Modulo Combinations of Equational Theories -- Combinations of Theories for Decidable Fragments of First-Order Logic -- Products of Modal Logics with Diagonal Constant Lacking the Finite Model Property -- Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme -- Combining Instance Generation and Resolution -- Data Structures with Arithmetic Constraints: A Non-disjoint Combination -- Efficient Combination of Decision Procedures for MUS Computation -- Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas -- Combining Theories with Shared Set Operations.
520 _aThis book constitutes the refereed proceedings of the 7th International Symposium on Frontiers of Combining Systems, FroCoS 2007, held in Trento, Italy, September 16-18, 2009. The 20 revised full papers presented were carefully reviewed and selected. The papers are organized in topical sections on combinations of logics, theories, and decision procedures; constraint solving and programming; combination issues in rewriting and programming as well as in logical frameworks and theorem proving systems.
650 0 _aArtificial intelligence.
650 0 _aComputer science.
650 0 _aMachine theory.
650 0 _aSoftware engineering.
650 0 _aAlgorithms.
650 1 4 _aArtificial Intelligence.
650 2 4 _aTheory of Computation.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aSoftware Engineering.
650 2 4 _aAlgorithms.
700 1 _aGhilardi, Silvio.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSebastiani, Roberto.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642042218
776 0 8 _iPrinted edition:
_z9783642042232
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v5749
856 4 0 _uhttps://doi.org/10.1007/978-3-642-04222-5
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c181101
_d181101