Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Automated Deduction - CADE-18 [[electronic resource] ] : 18th International Conference on Automated Deduction, Copenhagen, Denmark, July 27-30, 2002 Proceedings / / edited by Andrei Voronkov
| Automated Deduction - CADE-18 [[electronic resource] ] : 18th International Conference on Automated Deduction, Copenhagen, Denmark, July 27-30, 2002 Proceedings / / edited by Andrei Voronkov |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XII, 540 p.) |
| Disciplina | 006.3/33 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Mathematical logic Computer logic Programming languages (Electronic computers) Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs Programming Languages, Compilers, Interpreters |
| ISBN | 3-540-45620-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Description Logics and Semantic Web -- Reasoning with Expressive Description Logics: Theory and Practice -- BDD-Based Decision Procedures for -- Proof-Carrying Code and Compiler Verification -- Temporal Logic for Proof-Carrying Code -- A Gradual Approach to a More Trustworthy, Yet Scalable, Proof-Carrying Code -- Formal Verification of a Java Compiler in Isabelle -- Non-classical Logics -- Embedding Lax Logic into Intuitionistic Logic -- Combining Proof-Search and Counter-Model Construction for Deciding Gödel-Dummett Logic -- Connection-Based Proof Search in Propositional BI Logic -- System Descriptions -- DDDLIB: A Library for Solving Quantified Difference Inequalities -- An LCF-Style Interface between HOL and First-Order Logic -- System Description: The MathWeb Software Bus for Distributed Mathematical Reasoning -- Proof Development with ?mega -- Learn?matic: System Description -- HyLoRes 1.0: Direct Resolution for Hybrid Logics -- SAT -- Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points -- A Note on Symmetry Heuristics in SEM -- A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions -- Model Generation -- Deductive Search for Errors in Free Data Type Specifications Using Model Generation -- Reasoning by Symmetry and Function Ordering in Finite Model Generation -- Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations -- Session 7 -- A New Clausal Class Decidable by Hyperresolution -- CASC -- Spass Version 2.0 -- System Description: GrAnDe 1.0 -- The HR Program for Theorem Generation -- AutoBayes/CC — Combining Program Synthesis with Automatic Code Certification — System Description — -- CADE-CAV Invited Talk -- The Quest for Efficient Boolean Satisfiability Solvers -- Session 9 -- Recursive Path Orderings Can Be Context-Sensitive -- Combination of Decision Procedures -- Shostak Light -- Formal Verification of a Combination Decision Procedure -- Combining Multisets with Integers -- Logical Frameworks -- The Reflection Theorem: A Study in Meta-theoretic Reasoning -- Faster Proof Checking in the Edinburgh Logical Framework -- Solving for Set Variables in Higher-Order Theorem Proving -- Model Checking -- The Complexity of the Graded ?-Calculus -- Lazy Theorem Proving for Bounded Model Checking over Infinite Domains -- Equational Reasoning -- Well-Foundedness Is Sufficient for Completeness of Ordered Paramodulation -- Basic Syntactic Mutation -- The Next Waldmeister Loop -- Proof Theory -- Focussing Proof-Net Construction as a Middleware Paradigm -- Proof Analysis by Resolution. |
| Record Nr. | UNISA-996465523403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automated Deduction - CADE-18 : 18th International Conference on Automated Deduction, Copenhagen, Denmark, July 27-30, 2002 Proceedings / / edited by Andrei Voronkov
| Automated Deduction - CADE-18 : 18th International Conference on Automated Deduction, Copenhagen, Denmark, July 27-30, 2002 Proceedings / / edited by Andrei Voronkov |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XII, 540 p.) |
| Disciplina | 006.3/33 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Mathematical logic Computer logic Programming languages (Electronic computers) Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs Programming Languages, Compilers, Interpreters |
| ISBN | 3-540-45620-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Description Logics and Semantic Web -- Reasoning with Expressive Description Logics: Theory and Practice -- BDD-Based Decision Procedures for -- Proof-Carrying Code and Compiler Verification -- Temporal Logic for Proof-Carrying Code -- A Gradual Approach to a More Trustworthy, Yet Scalable, Proof-Carrying Code -- Formal Verification of a Java Compiler in Isabelle -- Non-classical Logics -- Embedding Lax Logic into Intuitionistic Logic -- Combining Proof-Search and Counter-Model Construction for Deciding Gödel-Dummett Logic -- Connection-Based Proof Search in Propositional BI Logic -- System Descriptions -- DDDLIB: A Library for Solving Quantified Difference Inequalities -- An LCF-Style Interface between HOL and First-Order Logic -- System Description: The MathWeb Software Bus for Distributed Mathematical Reasoning -- Proof Development with ?mega -- Learn?matic: System Description -- HyLoRes 1.0: Direct Resolution for Hybrid Logics -- SAT -- Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points -- A Note on Symmetry Heuristics in SEM -- A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions -- Model Generation -- Deductive Search for Errors in Free Data Type Specifications Using Model Generation -- Reasoning by Symmetry and Function Ordering in Finite Model Generation -- Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations -- Session 7 -- A New Clausal Class Decidable by Hyperresolution -- CASC -- Spass Version 2.0 -- System Description: GrAnDe 1.0 -- The HR Program for Theorem Generation -- AutoBayes/CC — Combining Program Synthesis with Automatic Code Certification — System Description — -- CADE-CAV Invited Talk -- The Quest for Efficient Boolean Satisfiability Solvers -- Session 9 -- Recursive Path Orderings Can Be Context-Sensitive -- Combination of Decision Procedures -- Shostak Light -- Formal Verification of a Combination Decision Procedure -- Combining Multisets with Integers -- Logical Frameworks -- The Reflection Theorem: A Study in Meta-theoretic Reasoning -- Faster Proof Checking in the Edinburgh Logical Framework -- Solving for Set Variables in Higher-Order Theorem Proving -- Model Checking -- The Complexity of the Graded ?-Calculus -- Lazy Theorem Proving for Bounded Model Checking over Infinite Domains -- Equational Reasoning -- Well-Foundedness Is Sufficient for Completeness of Ordered Paramodulation -- Basic Syntactic Mutation -- The Next Waldmeister Loop -- Proof Theory -- Focussing Proof-Net Construction as a Middleware Paradigm -- Proof Analysis by Resolution. |
| Record Nr. | UNINA-9910143883803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logic for Programming and Automated Reasoning [[electronic resource] ] : 7th International Conference, LPAR 2000 Reunion Island, France, November 6-10, 2000 Proceedings / / edited by Michel Parigot, Andrei Voronkov
| Logic for Programming and Automated Reasoning [[electronic resource] ] : 7th International Conference, LPAR 2000 Reunion Island, France, November 6-10, 2000 Proceedings / / edited by Michel Parigot, Andrei Voronkov |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XIV, 490 p.) |
| Disciplina | 005.1/15 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Mathematical logic
Programming languages (Electronic computers) Artificial intelligence Computer logic Mathematical Logic and Foundations Programming Languages, Compilers, Interpreters Artificial Intelligence Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN | 3-540-44404-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Nonmononic reasoning -- On the Complexity of Theory Curbing -- Descriptive complexity -- Graph Operations and Monadic Second-Order Logic: A Survey -- Efficient First Order Functional Program Interpreter with Time Bound Certifications -- Specification and automatic proof-assistants -- Encoding Temporal Logics in Executable Z: A Case Study for the ZETA System -- Behavioural Constructor Implementation for Regular Algebras -- An Extensible Proof Text Editor -- A Tactic Language for the System Coq -- Theorem proving -- Proof Simplification for Model Generation and Its Applications -- Have SPASS with OCC1N = g -- Verification -- Compiling and Verifying Security Protocols -- Equational Binary Decision Diagrams -- A PVS Proof Obligation Generator for Lustre Programs -- Logic programming and CLP -- Efficient Structural Information Analysis for Real CLP Languages -- Playing Logic Programs with the Alpha-Beta Algorithm -- Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A Comparison -- Nonclassical logics and lambda calculus -- Quantified Propositional Gödel Logics -- Proof-Search in Implicative Linear Logic as a Matching Problem -- A New Model Construction for the Polymorphic Lambda Calculus -- Church’s Lambda Delta Calculus -- Logic and databases -- Querying Inconsistent Databases -- How to Decide Query Containment under Constraints Using a Description Logic -- Program analysis -- Static Reduction Analysis for Imperative Object Oriented Languages -- An Abstract Interpretation Approach to Termination of Logic Programs -- Using an Abstract Representation to Specialize Functional Logic Programs -- Binding-Time Analysis by Constraint Solving -- Mu-calculus -- Efficient Evaluation Methods for Guarded Logics and Datalog LITE -- On the Alternation-Free Horn ?-Calculus -- Planning and reasoning about actions -- The Boundary between Decidable and Undecidable Fragments of the Fluent Calculus -- Solving Planning Problems by Partial Deduction -- A Kripkean Semantics for Dynamic Logic Programming. |
| Record Nr. | UNISA-996465909703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logic for Programming and Automated Reasoning : 7th International Conference, LPAR 2000 Reunion Island, France, November 6-10, 2000 Proceedings / / edited by Michel Parigot, Andrei Voronkov
| Logic for Programming and Automated Reasoning : 7th International Conference, LPAR 2000 Reunion Island, France, November 6-10, 2000 Proceedings / / edited by Michel Parigot, Andrei Voronkov |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XIV, 490 p.) |
| Disciplina | 005.1/15 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Mathematical logic
Programming languages (Electronic computers) Artificial intelligence Computer logic Mathematical Logic and Foundations Programming Languages, Compilers, Interpreters Artificial Intelligence Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN | 3-540-44404-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Nonmononic reasoning -- On the Complexity of Theory Curbing -- Descriptive complexity -- Graph Operations and Monadic Second-Order Logic: A Survey -- Efficient First Order Functional Program Interpreter with Time Bound Certifications -- Specification and automatic proof-assistants -- Encoding Temporal Logics in Executable Z: A Case Study for the ZETA System -- Behavioural Constructor Implementation for Regular Algebras -- An Extensible Proof Text Editor -- A Tactic Language for the System Coq -- Theorem proving -- Proof Simplification for Model Generation and Its Applications -- Have SPASS with OCC1N = g -- Verification -- Compiling and Verifying Security Protocols -- Equational Binary Decision Diagrams -- A PVS Proof Obligation Generator for Lustre Programs -- Logic programming and CLP -- Efficient Structural Information Analysis for Real CLP Languages -- Playing Logic Programs with the Alpha-Beta Algorithm -- Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A Comparison -- Nonclassical logics and lambda calculus -- Quantified Propositional Gödel Logics -- Proof-Search in Implicative Linear Logic as a Matching Problem -- A New Model Construction for the Polymorphic Lambda Calculus -- Church’s Lambda Delta Calculus -- Logic and databases -- Querying Inconsistent Databases -- How to Decide Query Containment under Constraints Using a Description Logic -- Program analysis -- Static Reduction Analysis for Imperative Object Oriented Languages -- An Abstract Interpretation Approach to Termination of Logic Programs -- Using an Abstract Representation to Specialize Functional Logic Programs -- Binding-Time Analysis by Constraint Solving -- Mu-calculus -- Efficient Evaluation Methods for Guarded Logics and Datalog LITE -- On the Alternation-Free Horn ?-Calculus -- Planning and reasoning about actions -- The Boundary between Decidable and Undecidable Fragments of the Fluent Calculus -- Solving Planning Problems by Partial Deduction -- A Kripkean Semantics for Dynamic Logic Programming. |
| Record Nr. | UNINA-9910143599603321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logic for Programming, Artificial Intelligence, and Reasoning [[electronic resource] ] : 20th International Conference, LPAR-20 2015, Suva, Fiji, November 24-28, 2015, Proceedings / / edited by Martin Davis, Ansgar Fehnker, Annabelle McIver, Andrei Voronkov
| Logic for Programming, Artificial Intelligence, and Reasoning [[electronic resource] ] : 20th International Conference, LPAR-20 2015, Suva, Fiji, November 24-28, 2015, Proceedings / / edited by Martin Davis, Ansgar Fehnker, Annabelle McIver, Andrei Voronkov |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XV, 640 p. 142 illus. in color.) |
| Disciplina | 004.015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Artificial intelligence Computer science Machine theory Computer programming Compilers (Computer programs) Software Engineering Artificial Intelligence Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Programming Techniques Compilers and Interpreters |
| ISBN | 3-662-48899-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996466189803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logic for Programming, Artificial Intelligence, and Reasoning : 20th International Conference, LPAR-20 2015, Suva, Fiji, November 24-28, 2015, Proceedings / / edited by Martin Davis, Ansgar Fehnker, Annabelle McIver, Andrei Voronkov
| Logic for Programming, Artificial Intelligence, and Reasoning : 20th International Conference, LPAR-20 2015, Suva, Fiji, November 24-28, 2015, Proceedings / / edited by Martin Davis, Ansgar Fehnker, Annabelle McIver, Andrei Voronkov |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XV, 640 p. 142 illus. in color.) |
| Disciplina | 004.015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Artificial intelligence Computer science Machine theory Computer programming Compilers (Computer programs) Software Engineering Artificial Intelligence Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Programming Techniques Compilers and Interpreters |
| ISBN | 3-662-48899-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910483086703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logic for Programming, Artificial Intelligence, and Reasoning [[electronic resource] ] : 19th International Conference, LPAR-19, Stellenbosch, South Africa, December 14-19, 2013, Proceedings / / edited by Ken McMillan, Aart Middeldorp, Andrei Voronkov
| Logic for Programming, Artificial Intelligence, and Reasoning [[electronic resource] ] : 19th International Conference, LPAR-19, Stellenbosch, South Africa, December 14-19, 2013, Proceedings / / edited by Ken McMillan, Aart Middeldorp, Andrei Voronkov |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XIV, 794 p. 178 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Artificial intelligence Computer science Machine theory Computer programming Compilers (Computer programs) Software Engineering Artificial Intelligence Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Programming Techniques Compilers and Interpreters |
| ISBN | 3-642-45221-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNISA-996465503503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logic for Programming, Artificial Intelligence, and Reasoning : 19th International Conference, LPAR-19, Stellenbosch, South Africa, December 14-19, 2013, Proceedings / / edited by Ken McMillan, Aart Middeldorp, Andrei Voronkov
| Logic for Programming, Artificial Intelligence, and Reasoning : 19th International Conference, LPAR-19, Stellenbosch, South Africa, December 14-19, 2013, Proceedings / / edited by Ken McMillan, Aart Middeldorp, Andrei Voronkov |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XIV, 794 p. 178 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Artificial intelligence Computer science Machine theory Computer programming Compilers (Computer programs) Software Engineering Artificial Intelligence Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Programming Techniques Compilers and Interpreters |
| ISBN | 3-642-45221-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNINA-9910484332703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logic for Programming, Artificial Intelligence, and Reasoning [[electronic resource] ] : 18th International Conference, LPAR-18, Merida, Venezuela, March 11-15, 2012, Proceedings / / edited by Nikolaj Bjørner, Andrei Voronkov
| Logic for Programming, Artificial Intelligence, and Reasoning [[electronic resource] ] : 18th International Conference, LPAR-18, Merida, Venezuela, March 11-15, 2012, Proceedings / / edited by Nikolaj Bjørner, Andrei Voronkov |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XI, 446 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Artificial intelligence Computer science Machine theory Computer programming Compilers (Computer programs) Software Engineering Artificial Intelligence Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Programming Techniques Compilers and Interpreters |
| ISBN | 3-642-28717-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996466261903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logic for Programming, Artificial Intelligence, and Reasoning [[electronic resource] ] : 16th International Conference, LPAR-16, Dakar, Senegal, April 25--May 1, 2010, Revised Selected Papers / / edited by Edmund M. Clarke, Andrei Voronkov
| Logic for Programming, Artificial Intelligence, and Reasoning [[electronic resource] ] : 16th International Conference, LPAR-16, Dakar, Senegal, April 25--May 1, 2010, Revised Selected Papers / / edited by Edmund M. Clarke, Andrei Voronkov |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (X, 517 p. 71 illus., 4 illus. in color.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Computer programming Software engineering Computer logic Mathematical logic Programming languages (Electronic computers) Artificial Intelligence Programming Techniques Software Engineering Logics and Meanings of Programs Mathematical Logic and Formal Languages Programming Languages, Compilers, Interpreters |
| ISBN |
1-283-47738-6
9786613477385 3-642-17511-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996466013603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
