Frontiers of combining systems : 13th international symposium, FroCoS 2021, Birmingham, UK, September 8-10, 2021 : proceedings / / Boris Konev, Giles Reger (editors) |
Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
Descrizione fisica | 1 online resource (314 pages) |
Disciplina | 511.3 |
Collana | Lecture notes in computer science |
Soggetto topico | Logic, Symbolic and mathematical |
ISBN | 3-030-86205-4 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996464491703316 |
Cham, Switzerland : , : Springer, , [2021] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Frontiers of combining systems : 13th international symposium, FroCoS 2021, Birmingham, UK, September 8-10, 2021 : proceedings / / Boris Konev, Giles Reger (editors) |
Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
Descrizione fisica | 1 online resource (314 pages) |
Disciplina | 511.3 |
Collana | Lecture notes in computer science |
Soggetto topico | Logic, Symbolic and mathematical |
ISBN | 3-030-86205-4 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910495194703321 |
Cham, Switzerland : , : Springer, , [2021] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Frontiers of combining systems : 6th international symposium, frocos 2007, liverpool, uk, september 10-12, 2007. Proceedings / / edited by Boris Konev, Frank Wolter |
Edizione | [1st ed. 2007.] |
Pubbl/distr/stampa | Berlin, Germany ; ; New York, United States : , : Springer, , [2007] |
Descrizione fisica | 1 online resource (X, 286 p.) |
Disciplina | 511.3 |
Collana | Lecture notes in computer science. Lecture notes in artificial intelligence ; 4720 |
Soggetto topico |
Computer science
Logic, Symbolic and mathematical |
ISBN | 3-540-74621-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Section 1. Invited Contributions -- Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL -- From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain -- Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory Extensions -- Temporalising Logics: Fifteen Years After -- Section 2. Technical Papers -- Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs -- A Compressing Translation from Propositional Resolution to Natural Deduction -- Combining Algorithms for Deciding Knowledge in Security Protocols -- Combining Classical and Intuitionistic Implications -- Towards an Automatic Analysis of Web Service Security -- Certification of Automated Termination Proofs -- Temporal Logic with Capacity Constraints -- Idempotent Transductions for Modal Logics -- A Temporal Logic of Robustness -- Noetherianity and Combination Problems -- Languages Modulo Normalization -- Combining Proof-Producing Decision Procedures -- Visibly Pushdown Languages and Term Rewriting -- Proving Termination Using Recursive Path Orders and SAT Solving. |
Altri titoli varianti | FroCos 2007 |
Record Nr. | UNINA-9910483346103321 |
Berlin, Germany ; ; New York, United States : , : Springer, , [2007] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Frontiers of combining systems : 6th international symposium, frocos 2007, liverpool, uk, september 10-12, 2007. Proceedings / / edited by Boris Konev, Frank Wolter |
Edizione | [1st ed. 2007.] |
Pubbl/distr/stampa | Berlin, Germany ; ; New York, United States : , : Springer, , [2007] |
Descrizione fisica | 1 online resource (X, 286 p.) |
Disciplina | 511.3 |
Collana | Lecture notes in computer science. Lecture notes in artificial intelligence ; 4720 |
Soggetto topico |
Computer science
Logic, Symbolic and mathematical |
ISBN | 3-540-74621-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Section 1. Invited Contributions -- Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL -- From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain -- Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory Extensions -- Temporalising Logics: Fifteen Years After -- Section 2. Technical Papers -- Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs -- A Compressing Translation from Propositional Resolution to Natural Deduction -- Combining Algorithms for Deciding Knowledge in Security Protocols -- Combining Classical and Intuitionistic Implications -- Towards an Automatic Analysis of Web Service Security -- Certification of Automated Termination Proofs -- Temporal Logic with Capacity Constraints -- Idempotent Transductions for Modal Logics -- A Temporal Logic of Robustness -- Noetherianity and Combination Problems -- Languages Modulo Normalization -- Combining Proof-Producing Decision Procedures -- Visibly Pushdown Languages and Term Rewriting -- Proving Termination Using Recursive Path Orders and SAT Solving. |
Altri titoli varianti | FroCos 2007 |
Record Nr. | UNISA-996465926103316 |
Berlin, Germany ; ; New York, United States : , : Springer, , [2007] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Logics in Artificial Intelligence [[electronic resource] ] : 10th European Conference, JELIA 2006, Liverpool, UK, September 13-15, 2006, Proceedings / / edited by Michael Fisher, Wiebe van der Hoek, Boris Konev, Alexei Lisitsa |
Edizione | [1st ed. 2006.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
Descrizione fisica | 1 online resource (XII, 520 p.) |
Disciplina | 006.3 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Computer programming Mathematical logic Artificial Intelligence Programming Techniques Mathematical Logic and Formal Languages |
Soggetto non controllato | JELIA |
ISBN | 3-540-39627-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- From Inductive Logic Programming to Relational Data Mining -- Answer Set Programming: A Declarative Approach to Solving Search Problems -- Inconsistencies in Ontologies -- Technical Papers -- On Arbitrary Selection Strategies for Basic Superposition -- An Event-Condition-Action Logic Programming Language -- Distance-Based Repairs of Databases -- Natural Deduction Calculus for Linear-Time Temporal Logic -- A STIT-Extension of ATL -- On the Logic and Computation of Partial Equilibrium Models -- Decidable Fragments of Logic Programming with Value Invention -- On the Issue of Reinstatement in Argumentation -- Comparing Action Descriptions Based on Semantic Preferences -- Modal Logics of Negotiation and Preference -- Representing Action Domains with Numeric-Valued Fluents -- Model Representation over Finite and Infinite Signatures -- Deciding Extensions of the Theory of Arrays by Integrating Decision Procedures and Instantiation Strategies -- Analytic Tableau Calculi for KLM Rational Logic R -- On the Semantics of Logic Programs with Preferences -- A Modularity Approach for a Fragment of -- Whatever You Say -- Automatic Deductive Synthesis of Lisp Programs in the System ALISA -- A Fault-Tolerant Default Logic -- Reasoning About Actions Using Description Logics with General TBoxes -- Introducing Attempt in a Modal Logic of Intentional Action -- On Herbrand’s Theorem for Intuitionistic Logic -- Ambiguity Propagating Defeasible Logic and the Well-Founded Semantics -- Hierarchical Argumentation -- Anti-prenexing and Prenexing for Modal Logics -- A Bottom-Up Method for the Deterministic Horn Fragment of the Description Logic -- Fuzzy Answer Set Programming -- Reasoning About an Agent Based on Its Revision History with Missing Inputs -- Knowledge Base Revision in Description Logics -- Incomplete Knowledge in Hybrid Probabilistic Logic Programs -- A Formal Analysis of KGP Agents -- Irrelevant Updates and Nonmonotonic Assumptions -- Towards Top-k Query Answering in Description Logics: The Case of DL-Lite -- Representing Causal Information About a Probabilistic Process -- Tool Descriptions -- A Tool to Facilitate Agent Deliberation -- An Implementation of a Lightweight Argumentation Engine for Agent Applications -- A Tool for Answering Queries on Action Descriptions -- An Implementation for Recognizing Rule Replacements in Non-ground Answer-Set Programs -- April – An Inductive Logic Programming System -- optsat: A Tool for Solving SAT Related Optimization Problems -- Automated Reasoning About Metric and Topology -- The QBFEVAL Web Portal -- A Slicing Tool for Lazy Functional Logic Programs -- cc?: A Correspondence-Checking Tool for Logic Programs Under the Answer-Set Semantics -- A Logic-Based Tool for Semantic Information Extraction -- tarfa: Tableaux and Resolution for Finite Abduction. |
Record Nr. | UNISA-996466129703316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|