Frontiers of Combining Systems
-15%
portes grátis
Frontiers of Combining Systems
11th International Symposium, FroCoS 2017, Brasilia, Brazil, September 27-29, 2017, Proceedings
Dixon, Clare; Finger, Marcelo
Springer International Publishing AG
08/2017
351
Mole
Inglês
9783319661667
15 a 20 dias
5504
Descrição não disponível.
Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic.- Designing Theory Solvers with Extensions.- First-Order Interpolation of Non-Classical Logics Derived from Propositional Interpolation.- A New Description Logic with Set Constraints and Cardinality Constraints on Role Successors.- Interpolation, Amalgamation and Combination (the Non-disjoint Signatures Case).- Subtropical Satisfiability.- Finitariness of Elementary Unification in Boolean Region Connection Calculus.- Metric Temporal Description Logics with Interval-Rigid Names.- Superposition with Integrated Induction.- The Bernays-Schoenfinkel-Ramsey Fragment with Bounded Difference Constraints over the Reals is Decidable.- Decidable Verification of Decision-Theoretic Golog.- Pushing the Boundaries of Reasoning About Qualified Cardinality Restrictions.- Complexity Analysis for Term Rewriting by Integer Transition Systems.- Using Ontologies to Query Probabilistic Numerical Data.- Merging Fragments of Classical Logic.- On Solving Nominal Fixpoint Equations.- Parallel Closure Theorem for Left-Linear Nominal Rewriting Systems.- Solving SAT and MaxSAT with a Quantum Annealer: Foundations and a Preliminary Report.- The Boolean Solution Problem from the Perspective of Predicate Logic.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Artificial intelligence;Automated reasoning;Description logics;Equational logic and rewriting;Interpolation;Logic and verification;Modal and temporal logics;Permutations and combinations;Problem solving;Proof theory;Semantics;Stochastic processes;Theorem proving and SAT solving;Verification by model checking;algorithm analysis and problem complexity
Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic.- Designing Theory Solvers with Extensions.- First-Order Interpolation of Non-Classical Logics Derived from Propositional Interpolation.- A New Description Logic with Set Constraints and Cardinality Constraints on Role Successors.- Interpolation, Amalgamation and Combination (the Non-disjoint Signatures Case).- Subtropical Satisfiability.- Finitariness of Elementary Unification in Boolean Region Connection Calculus.- Metric Temporal Description Logics with Interval-Rigid Names.- Superposition with Integrated Induction.- The Bernays-Schoenfinkel-Ramsey Fragment with Bounded Difference Constraints over the Reals is Decidable.- Decidable Verification of Decision-Theoretic Golog.- Pushing the Boundaries of Reasoning About Qualified Cardinality Restrictions.- Complexity Analysis for Term Rewriting by Integer Transition Systems.- Using Ontologies to Query Probabilistic Numerical Data.- Merging Fragments of Classical Logic.- On Solving Nominal Fixpoint Equations.- Parallel Closure Theorem for Left-Linear Nominal Rewriting Systems.- Solving SAT and MaxSAT with a Quantum Annealer: Foundations and a Preliminary Report.- The Boolean Solution Problem from the Perspective of Predicate Logic.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Artificial intelligence;Automated reasoning;Description logics;Equational logic and rewriting;Interpolation;Logic and verification;Modal and temporal logics;Permutations and combinations;Problem solving;Proof theory;Semantics;Stochastic processes;Theorem proving and SAT solving;Verification by model checking;algorithm analysis and problem complexity
