skip to content
Logic for Programming, Artificial Intelligence, and Reasoning : 19th International Conference, LPAR-19, Stellenbosch, South Africa, December 14-19, 2013. Proceedings Preview this item
ClosePreview this item
Checking...

Logic for Programming, Artificial Intelligence, and Reasoning : 19th International Conference, LPAR-19, Stellenbosch, South Africa, December 14-19, 2013. Proceedings

Author: Ken McMillan; Aart Middeldorp; Andrei Voronkov
Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint : Springer, 2013.
Series: Lecture notes in computer science, 8312.
Edition/Format:   eBook : Document : EnglishView all editions and formats
Summary:
This book constitutes the proceedings of the 19th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR-19, held in December 2013 in Stellenbosch, South Africa. The 44 regular papers and 8 tool descriptions and experimental papers included in this volume were carefully reviewed and selected from 152 submissions. The series of International Conferences on Logic for  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Electronic books
Ebook
Conference papers and proceedings
Additional Physical Format: Printed edition:
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Ken McMillan; Aart Middeldorp; Andrei Voronkov
ISBN: 9783642452215 3642452213
OCLC Number: 1027562262
Description: 1 online resource (XIV, 794 pages 178 illustrations) : online resource
Contents: An Algorithm for Enumerating Maximal Models of Horn Theories with an Application to Modal Logics --
May-Happen-in-Parallel Analysis for Priority-Based Scheduling --
The Complexity of Clausal Fragments of LTL --
A Semantic Basis for Proof Queries and Transformations --
Expressive Path Queries on Graphs with Data --
Proving Infinite Satisfiability --
SAT-Based Preprocessing for MaxSAT --
Dynamic and Static Symmetry Breaking in Answer Set Programming --
HOL Based First-Order Modal Logic Provers --
Resourceful Reachability as HORN-LA --
A Seligman-Style Tableau System --
Comparison of LTL to Deterministic Rabin Automata Translators --
Tree Interpolation in Vampire --
Polarizing Double-Negation Translations --
Revisiting the Equivalence of Shininess and Politeness --
Towards Rational Closure for Fuzzy Logic: The Case of Propositional Gödel Logic --
Multi-objective Discounted Reward Verification in Graphs and MDPs --
Description Logics, Rules and Multi-context Systems --
Complexity Analysis in Presence of Control Operators and Higher-Order Functions --
Zenon Modulo: When Achilles Outruns the Tortoise Using Deduction Modulo --
Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving --
Verifying Temporal Properties in Real Models --
A Graphical Language for Proof Strategies --
A Proof of Strong Normalisation of the Typed Atomic Lambda-Calculus --
Relaxing Synchronization Constraints in Behavioral Programs --
Characterizing Subset Spaces as Bi-topological Structures --
Proof-Pattern Recognition and Lemma Discovery in ACL2 --
Semantic A-translations and Super-Consistency Entail Classical Cut Elimination --
Blocked Clause Decomposition --
Maximal Falsifiability: Definitions, Algorithms, and Applications --
Solving Geometry Problems Using a Combination of Symbolic and Numerical Reasoning --
On QBF Proofs and Preprocessing --
Partial Backtracking in CDCL Solvers --
Lemma Mining over HOL Light --
On Module-Based Abstraction and Repair of Behavioral Programs --
Prediction and Explanation over DL-Lite Data Streams --
Forgetting Concept and Role Symbols in ALCH-Ontologies --
Simulating Parity Reasoning --
Herbrand Theorems for Substructural Logics --
On Promptness in Parity Games --
Defining Privacy Is Supposed to Be Easy --
Reachability Modules for the Description Logic SRIQ --
An Event Structure Model for Probabilistic Concurrent Kleene Algebra --
Three SCC-Based Emptiness Checks for Generalized Büchi Automata --
PeRIPLO: A Framework for Producing Effective Interpolants in SAT-Based Software Verification --
Incremental Tabling for Query-Driven Propagation of Logic Program Updates --
Tracking Data-Flow with Open Closure Types --
Putting Newton into Practice: A Solver for Polynomial Equations over Semirings --
System Description: E 1.8 --
Formalization of Laplace Transform Using the Multivariable Calculus Theory of HOL-Light --
On Minimality and Integrity Constraints in Probabilistic Abduction --
POLAR: A Framework for Proof Refactoring.
Series Title: Lecture notes in computer science, 8312.
Responsibility: edited by Ken McMillan, Aart Middeldorp, Andrei Voronkov.

Abstract:

This book constitutes the proceedings of the 19th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR-19, held in December 2013 in Stellenbosch, South Africa. The 44 regular papers and 8 tool descriptions and experimental papers included in this volume were carefully reviewed and selected from 152 submissions. The series of International Conferences on Logic for Programming, Artificial Intelligence and Reasoning (LPAR) is a forum where year after year, some of the most renowned researchers in the areas of logic, automated reasoning, computational logic, programming languages and their applications come to present cutting-edge results, to discuss advances in these fields and to exchange ideas in a scientifically emerging part of the world.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/1027562262> # Logic for Programming, Artificial Intelligence, and Reasoning : 19th International Conference, LPAR-19, Stellenbosch, South Africa, December 14-19, 2013. Proceedings
    a schema:Book, schema:CreativeWork, schema:MediaObject ;
    library:oclcnum "1027562262" ;
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
    schema:about <http://dewey.info/class/005.1/e23/> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/4799717077#Topic/computer_science> ; # Computer science
    schema:about <http://experiment.worldcat.org/entity/work/data/4799717077#Topic/software_engineering> ; # Software engineering
    schema:about <http://experiment.worldcat.org/entity/work/data/4799717077#Topic/programming_languages_electronic_computers> ; # Programming languages (Electronic computers)
    schema:about <http://experiment.worldcat.org/entity/work/data/4799717077#Topic/logic_symbolic_and_mathematical> ; # Logic, Symbolic and mathematical
    schema:about <http://experiment.worldcat.org/entity/work/data/4799717077#Topic/computer_programming> ; # Computer programming
    schema:about <http://experiment.worldcat.org/entity/work/data/4799717077#Topic/computer_logic> ; # Computer logic
    schema:about <http://experiment.worldcat.org/entity/work/data/4799717077#Topic/artificial_intelligence> ; # Artificial intelligence
    schema:bookFormat schema:EBook ;
    schema:datePublished "2013" ;
    schema:description "An Algorithm for Enumerating Maximal Models of Horn Theories with an Application to Modal Logics -- May-Happen-in-Parallel Analysis for Priority-Based Scheduling -- The Complexity of Clausal Fragments of LTL -- A Semantic Basis for Proof Queries and Transformations -- Expressive Path Queries on Graphs with Data -- Proving Infinite Satisfiability -- SAT-Based Preprocessing for MaxSAT -- Dynamic and Static Symmetry Breaking in Answer Set Programming -- HOL Based First-Order Modal Logic Provers -- Resourceful Reachability as HORN-LA -- A Seligman-Style Tableau System -- Comparison of LTL to Deterministic Rabin Automata Translators -- Tree Interpolation in Vampire -- Polarizing Double-Negation Translations -- Revisiting the Equivalence of Shininess and Politeness -- Towards Rational Closure for Fuzzy Logic: The Case of Propositional Gödel Logic -- Multi-objective Discounted Reward Verification in Graphs and MDPs -- Description Logics, Rules and Multi-context Systems -- Complexity Analysis in Presence of Control Operators and Higher-Order Functions -- Zenon Modulo: When Achilles Outruns the Tortoise Using Deduction Modulo -- Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving -- Verifying Temporal Properties in Real Models -- A Graphical Language for Proof Strategies -- A Proof of Strong Normalisation of the Typed Atomic Lambda-Calculus -- Relaxing Synchronization Constraints in Behavioral Programs -- Characterizing Subset Spaces as Bi-topological Structures -- Proof-Pattern Recognition and Lemma Discovery in ACL2 -- Semantic A-translations and Super-Consistency Entail Classical Cut Elimination -- Blocked Clause Decomposition -- Maximal Falsifiability: Definitions, Algorithms, and Applications -- Solving Geometry Problems Using a Combination of Symbolic and Numerical Reasoning -- On QBF Proofs and Preprocessing -- Partial Backtracking in CDCL Solvers -- Lemma Mining over HOL Light -- On Module-Based Abstraction and Repair of Behavioral Programs -- Prediction and Explanation over DL-Lite Data Streams -- Forgetting Concept and Role Symbols in ALCH-Ontologies -- Simulating Parity Reasoning -- Herbrand Theorems for Substructural Logics -- On Promptness in Parity Games -- Defining Privacy Is Supposed to Be Easy -- Reachability Modules for the Description Logic SRIQ -- An Event Structure Model for Probabilistic Concurrent Kleene Algebra -- Three SCC-Based Emptiness Checks for Generalized Büchi Automata -- PeRIPLO: A Framework for Producing Effective Interpolants in SAT-Based Software Verification -- Incremental Tabling for Query-Driven Propagation of Logic Program Updates -- Tracking Data-Flow with Open Closure Types -- Putting Newton into Practice: A Solver for Polynomial Equations over Semirings -- System Description: E 1.8 -- Formalization of Laplace Transform Using the Multivariable Calculus Theory of HOL-Light -- On Minimality and Integrity Constraints in Probabilistic Abduction -- POLAR: A Framework for Proof Refactoring."@en ;
    schema:description "This book constitutes the proceedings of the 19th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR-19, held in December 2013 in Stellenbosch, South Africa. The 44 regular papers and 8 tool descriptions and experimental papers included in this volume were carefully reviewed and selected from 152 submissions. The series of International Conferences on Logic for Programming, Artificial Intelligence and Reasoning (LPAR) is a forum where year after year, some of the most renowned researchers in the areas of logic, automated reasoning, computational logic, programming languages and their applications come to present cutting-edge results, to discuss advances in these fields and to exchange ideas in a scientifically emerging part of the world."@en ;
    schema:editor <http://experiment.worldcat.org/entity/work/data/4799717077#Person/middeldorp_aart> ; # Aart Middeldorp
    schema:editor <http://experiment.worldcat.org/entity/work/data/4799717077#Person/mcmillan_ken> ; # Ken McMillan
    schema:editor <http://experiment.worldcat.org/entity/work/data/4799717077#Person/voronkov_andrei> ; # Andrei Voronkov
    schema:exampleOfWork <http://worldcat.org/entity/work/id/4799717077> ;
    schema:genre "Conference papers and proceedings"@en ;
    schema:genre "Electronic books"@en ;
    schema:genre "Ebook"@en ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://worldcat.org/issn/0302-9743> ; # Lecture notes in computer science ;
    schema:isSimilarTo <http://worldcat.org/entity/work/data/4799717077#CreativeWork/> ;
    schema:name "Logic for Programming, Artificial Intelligence, and Reasoning : 19th International Conference, LPAR-19, Stellenbosch, South Africa, December 14-19, 2013. Proceedings"@en ;
    schema:productID "1027562262" ;
    schema:url <https://link.springer.com/book/10.1007/978-3-642-45220-8> ;
    schema:url <http://VH7QX3XE2P.search.serialssolutions.com/?V=1.0&L=VH7QX3XE2P&S=JCs&C=TC0001091199&T=marc&tab=BOOKS> ;
    schema:url <http://books.scholarsportal.info/viewdoc.html?id=/ebooks/ebooks3/springer/2014-04-01/1/9783642452215> ;
    schema:url <https://link.springer.com/book/10.1007/978-3-642-45221-5> ;
    schema:url <https://doi.org/10.1007/978-3-642-45221-5> ;
    schema:url <https://public.ebookcentral.proquest.com/choice/publicfullrecord.aspx?p=3093487> ;
    schema:workExample <http://dx.doi.org/10.1007/978-3-642-45221-5> ;
    schema:workExample <http://worldcat.org/isbn/9783642452215> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/1027562262> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/4799717077#Person/mcmillan_ken> # Ken McMillan
    a schema:Person ;
    schema:familyName "McMillan" ;
    schema:givenName "Ken" ;
    schema:name "Ken McMillan" ;
    .

<http://experiment.worldcat.org/entity/work/data/4799717077#Person/middeldorp_aart> # Aart Middeldorp
    a schema:Person ;
    schema:familyName "Middeldorp" ;
    schema:givenName "Aart" ;
    schema:name "Aart Middeldorp" ;
    .

<http://experiment.worldcat.org/entity/work/data/4799717077#Person/voronkov_andrei> # Andrei Voronkov
    a schema:Person ;
    schema:familyName "Voronkov" ;
    schema:givenName "Andrei" ;
    schema:name "Andrei Voronkov" ;
    .

<http://experiment.worldcat.org/entity/work/data/4799717077#Topic/artificial_intelligence> # Artificial intelligence
    a schema:Intangible ;
    schema:name "Artificial intelligence"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/4799717077#Topic/computer_programming> # Computer programming
    a schema:Intangible ;
    schema:name "Computer programming"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/4799717077#Topic/logic_symbolic_and_mathematical> # Logic, Symbolic and mathematical
    a schema:Intangible ;
    schema:name "Logic, Symbolic and mathematical"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/4799717077#Topic/programming_languages_electronic_computers> # Programming languages (Electronic computers)
    a schema:Intangible ;
    schema:name "Programming languages (Electronic computers)"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/4799717077#Topic/software_engineering> # Software engineering
    a schema:Intangible ;
    schema:name "Software engineering"@en ;
    .

<http://worldcat.org/entity/work/data/4799717077#CreativeWork/>
    a schema:CreativeWork ;
    schema:description "Printed edition:" ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/1027562262> ; # Logic for Programming, Artificial Intelligence, and Reasoning : 19th International Conference, LPAR-19, Stellenbosch, South Africa, December 14-19, 2013. Proceedings
    .

<http://worldcat.org/isbn/9783642452215>
    a schema:ProductModel ;
    schema:isbn "3642452213" ;
    schema:isbn "9783642452215" ;
    .

<http://worldcat.org/issn/0302-9743> # Lecture notes in computer science ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/1027562262> ; # Logic for Programming, Artificial Intelligence, and Reasoning : 19th International Conference, LPAR-19, Stellenbosch, South Africa, December 14-19, 2013. Proceedings
    schema:issn "0302-9743" ;
    schema:name "Lecture notes in computer science ;" ;
    schema:name "Lecture Notes in Computer Science," ;
    .

<http://www.worldcat.org/title/-/oclc/1027562262>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
    schema:about <http://www.worldcat.org/oclc/1027562262> ; # Logic for Programming, Artificial Intelligence, and Reasoning : 19th International Conference, LPAR-19, Stellenbosch, South Africa, December 14-19, 2013. Proceedings
    schema:dateModified "2019-11-25" ;
    void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.