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.
Computational models of argument [[electronic resource] ] : Proceedings of COMMA 2012 / / edited by Bart Verheij, Stefan Szeider and Stefan Woltran
| Computational models of argument [[electronic resource] ] : Proceedings of COMMA 2012 / / edited by Bart Verheij, Stefan Szeider and Stefan Woltran |
| Pubbl/distr/stampa | Amsterdam, : IOS Press, 2012 |
| Descrizione fisica | 1 online resource (536 p.) |
| Disciplina | 003.5 |
| Altri autori (Persone) |
VerheijBart
SzeiderStefan WotlranStefan |
| Collana | Frontiers in artificial intelligence and applications Computational models of argument |
| Soggetto topico |
Artificial intelligence - Computer simulation
Reasoning - Computer simulation |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-299-33330-3
1-61499-111-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Title Page; Preface; Programme Committee; Additional Reviewers; Contents; Part I. Invited Talks; The Long and Winding Road: Forty Years of Argumentation; Formal Dialectic: From Aristotle to Pragma-Dialectics, and Beyond; Multiple Logics Within Argument: How Defeasible and Classical Reasoning Work Together; Part II. Innovative Applications; Some Facets of Argument Mining for Opinion Analysis; An Inquiry Learning Environment for Scientific Argumentation; Semi-Automated Argumentative Analysis of Online Product Reviews; Arguing with Preferences in EcoBioCap
An Analysis and Hypothesis Generation Platform for Heterogeneous Cancer DatabasesMaking Sense of Macro- and Micro-Argumentation in Policy-Deliberation: Visualisation Techniques and Representation Formats; Towards an Argument-Based Music Recommender System; Arguing About Firewall Policy; Part III. Regular Papers; A General QBF-Based Formalization of Abstract Argumentation Theory; Some Foundations for Probabilistic Abstract Argumentation; Argument Aggregation: Basic Axioms and Complexity Results; The Equational Approach to CF2 Semantics Argumentation Games for Admissibility and Cogency CriteriaUniform Argumentation Frameworks; Dishonest Arguments in Debate Games; On the Use of Presumptions in Structured Defeasible Reasoning; Automated Deployment of Argumentation Protocols; On Preferred Extension Enumeration in Abstract Argumentation; Towards Experimental Algorithms for Abstract Argumentation; A Dialogue Game for Coalition Structure Generation with Self-Interested Agents; Complexity of Logic-Based Argumentation in Schaefer's Framework; Argumentation Dialogues for Two-Agent Conflict Resolution Comparing the Expressiveness of Argumentation SemanticsComputational Aspects of cf2 and stage2 Argumentation Semantics; Tactics and Concessions for Argumentation-Based Negotiation; Default Reasoning About Actions via Abstract Argumentation; Resolutions in Structured Argumentation; Mechanism Design for Argumentation-Based Persuasion; Persuasion Strategies for Argumentation About Plans; Selecting Extensions in Weighted Argumentation Frameworks; Group Persuasion Through Uncertain Audience Modelling; On Input/Output Argumentation Frameworks; Dialogue Templates for Automatic Argument Processing Valued-Based Argumentation for Tree-Like Value GraphsInterchanging Arguments Between Carneades and AIF; Towards Argument-Based Foundation for Sceptical and Credulous Dialogue Games; The Structure of Ad Hominem Dialogues; Towards Argumentation About Subjective Probabilities; Argument Schemes for Reasoning About Trust; Clarifying Some Misconceptions on the ASPIC+ Framework; Generating Abstract Arguments: A Natural Language Approach; Towards Argumentation with Symbolic Dempster-Shafer Evidence; Conditional Acceptance Functions; Grounded Semantics as Persuasion Dialogue Picking the Right Expert to Make a Debate Uncontroversial |
| Record Nr. | UNINA-9910462288903321 |
| Amsterdam, : IOS Press, 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computational models of argument [[electronic resource] ] : Proceedings of COMMA 2012 / / edited by Bart Verheij, Stefan Szeider and Stefan Woltran
| Computational models of argument [[electronic resource] ] : Proceedings of COMMA 2012 / / edited by Bart Verheij, Stefan Szeider and Stefan Woltran |
| Pubbl/distr/stampa | Amsterdam, : IOS Press, 2012 |
| Descrizione fisica | 1 online resource (536 p.) |
| Disciplina | 003.5 |
| Altri autori (Persone) |
VerheijBart
SzeiderStefan WotlranStefan |
| Collana | Frontiers in artificial intelligence and applications Computational models of argument |
| Soggetto topico |
Artificial intelligence - Computer simulation
Reasoning - Computer simulation |
| ISBN |
1-299-33330-3
1-61499-111-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Title Page; Preface; Programme Committee; Additional Reviewers; Contents; Part I. Invited Talks; The Long and Winding Road: Forty Years of Argumentation; Formal Dialectic: From Aristotle to Pragma-Dialectics, and Beyond; Multiple Logics Within Argument: How Defeasible and Classical Reasoning Work Together; Part II. Innovative Applications; Some Facets of Argument Mining for Opinion Analysis; An Inquiry Learning Environment for Scientific Argumentation; Semi-Automated Argumentative Analysis of Online Product Reviews; Arguing with Preferences in EcoBioCap
An Analysis and Hypothesis Generation Platform for Heterogeneous Cancer DatabasesMaking Sense of Macro- and Micro-Argumentation in Policy-Deliberation: Visualisation Techniques and Representation Formats; Towards an Argument-Based Music Recommender System; Arguing About Firewall Policy; Part III. Regular Papers; A General QBF-Based Formalization of Abstract Argumentation Theory; Some Foundations for Probabilistic Abstract Argumentation; Argument Aggregation: Basic Axioms and Complexity Results; The Equational Approach to CF2 Semantics Argumentation Games for Admissibility and Cogency CriteriaUniform Argumentation Frameworks; Dishonest Arguments in Debate Games; On the Use of Presumptions in Structured Defeasible Reasoning; Automated Deployment of Argumentation Protocols; On Preferred Extension Enumeration in Abstract Argumentation; Towards Experimental Algorithms for Abstract Argumentation; A Dialogue Game for Coalition Structure Generation with Self-Interested Agents; Complexity of Logic-Based Argumentation in Schaefer's Framework; Argumentation Dialogues for Two-Agent Conflict Resolution Comparing the Expressiveness of Argumentation SemanticsComputational Aspects of cf2 and stage2 Argumentation Semantics; Tactics and Concessions for Argumentation-Based Negotiation; Default Reasoning About Actions via Abstract Argumentation; Resolutions in Structured Argumentation; Mechanism Design for Argumentation-Based Persuasion; Persuasion Strategies for Argumentation About Plans; Selecting Extensions in Weighted Argumentation Frameworks; Group Persuasion Through Uncertain Audience Modelling; On Input/Output Argumentation Frameworks; Dialogue Templates for Automatic Argument Processing Valued-Based Argumentation for Tree-Like Value GraphsInterchanging Arguments Between Carneades and AIF; Towards Argument-Based Foundation for Sceptical and Credulous Dialogue Games; The Structure of Ad Hominem Dialogues; Towards Argumentation About Subjective Probabilities; Argument Schemes for Reasoning About Trust; Clarifying Some Misconceptions on the ASPIC+ Framework; Generating Abstract Arguments: A Natural Language Approach; Towards Argumentation with Symbolic Dempster-Shafer Evidence; Conditional Acceptance Functions; Grounded Semantics as Persuasion Dialogue Picking the Right Expert to Make a Debate Uncontroversial |
| Record Nr. | UNINA-9910785991603321 |
| Amsterdam, : IOS Press, 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computational models of argument [[electronic resource] ] : Proceedings of COMMA 2012 / / edited by Bart Verheij, Stefan Szeider and Stefan Woltran
| Computational models of argument [[electronic resource] ] : Proceedings of COMMA 2012 / / edited by Bart Verheij, Stefan Szeider and Stefan Woltran |
| Pubbl/distr/stampa | Amsterdam, : IOS Press, 2012 |
| Descrizione fisica | 1 online resource (536 p.) |
| Disciplina | 003.5 |
| Altri autori (Persone) |
VerheijBart
SzeiderStefan WotlranStefan |
| Collana | Frontiers in artificial intelligence and applications Computational models of argument |
| Soggetto topico |
Artificial intelligence - Computer simulation
Reasoning - Computer simulation |
| ISBN |
1-299-33330-3
1-61499-111-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Title Page; Preface; Programme Committee; Additional Reviewers; Contents; Part I. Invited Talks; The Long and Winding Road: Forty Years of Argumentation; Formal Dialectic: From Aristotle to Pragma-Dialectics, and Beyond; Multiple Logics Within Argument: How Defeasible and Classical Reasoning Work Together; Part II. Innovative Applications; Some Facets of Argument Mining for Opinion Analysis; An Inquiry Learning Environment for Scientific Argumentation; Semi-Automated Argumentative Analysis of Online Product Reviews; Arguing with Preferences in EcoBioCap
An Analysis and Hypothesis Generation Platform for Heterogeneous Cancer DatabasesMaking Sense of Macro- and Micro-Argumentation in Policy-Deliberation: Visualisation Techniques and Representation Formats; Towards an Argument-Based Music Recommender System; Arguing About Firewall Policy; Part III. Regular Papers; A General QBF-Based Formalization of Abstract Argumentation Theory; Some Foundations for Probabilistic Abstract Argumentation; Argument Aggregation: Basic Axioms and Complexity Results; The Equational Approach to CF2 Semantics Argumentation Games for Admissibility and Cogency CriteriaUniform Argumentation Frameworks; Dishonest Arguments in Debate Games; On the Use of Presumptions in Structured Defeasible Reasoning; Automated Deployment of Argumentation Protocols; On Preferred Extension Enumeration in Abstract Argumentation; Towards Experimental Algorithms for Abstract Argumentation; A Dialogue Game for Coalition Structure Generation with Self-Interested Agents; Complexity of Logic-Based Argumentation in Schaefer's Framework; Argumentation Dialogues for Two-Agent Conflict Resolution Comparing the Expressiveness of Argumentation SemanticsComputational Aspects of cf2 and stage2 Argumentation Semantics; Tactics and Concessions for Argumentation-Based Negotiation; Default Reasoning About Actions via Abstract Argumentation; Resolutions in Structured Argumentation; Mechanism Design for Argumentation-Based Persuasion; Persuasion Strategies for Argumentation About Plans; Selecting Extensions in Weighted Argumentation Frameworks; Group Persuasion Through Uncertain Audience Modelling; On Input/Output Argumentation Frameworks; Dialogue Templates for Automatic Argument Processing Valued-Based Argumentation for Tree-Like Value GraphsInterchanging Arguments Between Carneades and AIF; Towards Argument-Based Foundation for Sceptical and Credulous Dialogue Games; The Structure of Ad Hominem Dialogues; Towards Argumentation About Subjective Probabilities; Argument Schemes for Reasoning About Trust; Clarifying Some Misconceptions on the ASPIC+ Framework; Generating Abstract Arguments: A Natural Language Approach; Towards Argumentation with Symbolic Dempster-Shafer Evidence; Conditional Acceptance Functions; Grounded Semantics as Persuasion Dialogue Picking the Right Expert to Make a Debate Uncontroversial |
| Record Nr. | UNINA-9910819666903321 |
| Amsterdam, : IOS Press, 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Parameterized and Exact Computation [[electronic resource] ] : 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers / / edited by Gregory Gutin, Stefan Szeider
| Parameterized and Exact Computation [[electronic resource] ] : 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers / / edited by Gregory Gutin, Stefan Szeider |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 375 p. 28 illus.) |
| Disciplina | 519.544 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Numerical analysis Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Numerical Analysis Discrete Mathematics in Computer Science Data Science Mathematical Applications in Computer Science |
| ISBN | 3-319-03898-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Exact Complexity and Satisfiability.- The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups.- Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints.- Declarative Dynamic Programming as an Alternative Realization of Courcelle’s Theorem -- The Fine Details of Fast Dynamic Programming over Tree Decompositions.- On Subexponential and FPT-Time Inapproximability.- Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization.- Chain Minors Are FPT.- Incompressibility of H-Free Edge Modification.- Contracting Few Edges to Remove Forbidden Induced Subgraphs.- Fixed-Parameter and Approximation Algorithms: A New Look.- Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs.- Computing Tree-Depth Faster Than 2n.- Faster Exact Algorithms for Some Terminal Set Problems.- Parameterized Algorithms for Modular-Width.- A Faster FPT Algorithm for Bipartite Contraction.- On the Ordered List Subgraph Embedding Problems.- A Completeness Theory for Polynomial (Turing) Kernelization.- On Sparsification for Computing Treewidth.- The Jump Number Problem: Exact and Parameterized.- On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges.- Hardness of r-dominating set on Graphs of Diameter (r + 1).- Amalgam Width of Matroids.- On the Parameterized Complexity of Reconfiguration Problems.- FPT Algorithms for Consecutive Ones Submatrix Problems.- Upper Bounds on Boolean-Width with Applications to Exact Algorithms.- Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions.- Completeness Results for Parameterized Space Classes.- Treewidth and Pure Nash Equilibria -- Algorithms for k-Internal Out-Branching. |
| Record Nr. | UNISA-996465379803316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Parameterized and Exact Computation [[electronic resource] ] : 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers / / edited by Gregory Gutin, Stefan Szeider
| Parameterized and Exact Computation [[electronic resource] ] : 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers / / edited by Gregory Gutin, Stefan Szeider |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 375 p. 28 illus.) |
| Disciplina | 519.544 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Numerical analysis Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Numerical Analysis Discrete Mathematics in Computer Science Data Science Mathematical Applications in Computer Science |
| ISBN | 3-319-03898-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Exact Complexity and Satisfiability.- The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups.- Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints.- Declarative Dynamic Programming as an Alternative Realization of Courcelle’s Theorem -- The Fine Details of Fast Dynamic Programming over Tree Decompositions.- On Subexponential and FPT-Time Inapproximability.- Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization.- Chain Minors Are FPT.- Incompressibility of H-Free Edge Modification.- Contracting Few Edges to Remove Forbidden Induced Subgraphs.- Fixed-Parameter and Approximation Algorithms: A New Look.- Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs.- Computing Tree-Depth Faster Than 2n.- Faster Exact Algorithms for Some Terminal Set Problems.- Parameterized Algorithms for Modular-Width.- A Faster FPT Algorithm for Bipartite Contraction.- On the Ordered List Subgraph Embedding Problems.- A Completeness Theory for Polynomial (Turing) Kernelization.- On Sparsification for Computing Treewidth.- The Jump Number Problem: Exact and Parameterized.- On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges.- Hardness of r-dominating set on Graphs of Diameter (r + 1).- Amalgam Width of Matroids.- On the Parameterized Complexity of Reconfiguration Problems.- FPT Algorithms for Consecutive Ones Submatrix Problems.- Upper Bounds on Boolean-Width with Applications to Exact Algorithms.- Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions.- Completeness Results for Parameterized Space Classes.- Treewidth and Pure Nash Equilibria -- Algorithms for k-Internal Out-Branching. |
| Record Nr. | UNINA-9910484535803321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theory and Applications of Satisfiability Testing - SAT 2010 [[electronic resource] ] : 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010, Proceedings / / edited by Ofer Strichman, Stefan Szeider
| Theory and Applications of Satisfiability Testing - SAT 2010 [[electronic resource] ] : 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010, Proceedings / / edited by Ofer Strichman, Stefan Szeider |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XIII, 400 p. 74 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Software engineering Computer programming Computer science Machine theory Computer science—Mathematics Software Engineering Programming Techniques Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Mathematics of Computing |
| ISBN |
1-280-38775-0
9786613565679 3-642-14186-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1. Invited Talks -- The Big Deal: Applying Constraint Satisfaction Technologies Where It Makes the Difference -- Exact Algorithms and Complexity -- 2. Regular Papers -- Improving Stochastic Local Search for SAT with a New Probability Distribution -- Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas -- Proof Complexity of Propositional Default Logic -- Automated Testing and Debugging of SAT and QBF Solvers -- Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN -- Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT -- sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning -- Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold -- Symmetry and Satisfiability: An Update -- A Non-prenex, Non-clausal QBF Solver with Game-State Learning -- SAT Solving with Reference Points -- Integrating Dependency Schemes in Search-Based QBF Solvers -- An Exact Algorithm for the Boolean Connectivity Problem for k-CNF -- Improving Unsatisfiability-Based Algorithms for Boolean Optimization -- Encoding Techniques, Craig Interpolants and Bounded Model Checking for Incomplete Designs -- Statistical Methodology for Comparison of SAT Solvers -- On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem -- The Seventh QBF Solvers Evaluation (QBFEVAL’10) -- Complexity Results for Linear XSAT-Problems -- Bounds on Threshold of Regular Random k-SAT -- Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT -- 3. Short Papers -- Improved Local Search for Circuit Satisfiability -- A System for Solving Constraint Satisfaction Problems with SMT -- Two Techniques for Minimizing Resolution Proofs -- On Moderately Exponential Time for SAT -- Minimising Deterministic Büchi Automata Precisely Using SAT Solving -- Exploiting Circuit Representations in QBF Solving -- Reconstructing Solutions after Blocked Clause Elimination -- An Empirical Study of Optimal Noise and Runtime Distributions in Local Search -- Green-Tao Numbers and SAT -- Exact MinSAT Solving -- Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable -- Assignment Stack Shrinking -- Simple but Hard Mixed Horn Formulas -- Zero-One Designs Produce Small Hard SAT Instances. |
| Record Nr. | UNISA-996465779603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theory and Applications of Satisfiability Testing - SAT 2010 [[electronic resource] ] : 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010, Proceedings / / edited by Ofer Strichman, Stefan Szeider
| Theory and Applications of Satisfiability Testing - SAT 2010 [[electronic resource] ] : 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010, Proceedings / / edited by Ofer Strichman, Stefan Szeider |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XIII, 400 p. 74 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Software engineering Computer programming Computer science Machine theory Computer science—Mathematics Software Engineering Programming Techniques Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Mathematics of Computing |
| ISBN |
1-280-38775-0
9786613565679 3-642-14186-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1. Invited Talks -- The Big Deal: Applying Constraint Satisfaction Technologies Where It Makes the Difference -- Exact Algorithms and Complexity -- 2. Regular Papers -- Improving Stochastic Local Search for SAT with a New Probability Distribution -- Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas -- Proof Complexity of Propositional Default Logic -- Automated Testing and Debugging of SAT and QBF Solvers -- Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN -- Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT -- sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning -- Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold -- Symmetry and Satisfiability: An Update -- A Non-prenex, Non-clausal QBF Solver with Game-State Learning -- SAT Solving with Reference Points -- Integrating Dependency Schemes in Search-Based QBF Solvers -- An Exact Algorithm for the Boolean Connectivity Problem for k-CNF -- Improving Unsatisfiability-Based Algorithms for Boolean Optimization -- Encoding Techniques, Craig Interpolants and Bounded Model Checking for Incomplete Designs -- Statistical Methodology for Comparison of SAT Solvers -- On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem -- The Seventh QBF Solvers Evaluation (QBFEVAL’10) -- Complexity Results for Linear XSAT-Problems -- Bounds on Threshold of Regular Random k-SAT -- Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT -- 3. Short Papers -- Improved Local Search for Circuit Satisfiability -- A System for Solving Constraint Satisfaction Problems with SMT -- Two Techniques for Minimizing Resolution Proofs -- On Moderately Exponential Time for SAT -- Minimising Deterministic Büchi Automata Precisely Using SAT Solving -- Exploiting Circuit Representations in QBF Solving -- Reconstructing Solutions after Blocked Clause Elimination -- An Empirical Study of Optimal Noise and Runtime Distributions in Local Search -- Green-Tao Numbers and SAT -- Exact MinSAT Solving -- Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable -- Assignment Stack Shrinking -- Simple but Hard Mixed Horn Formulas -- Zero-One Designs Produce Small Hard SAT Instances. |
| Record Nr. | UNINA-9910483675403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||