FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

A
algebraic extensions	New in CoCoA-5.2.4 and CoCoALib-0.99570 for SC-Square (PDF, talk)
algebraic proof systems	Refutation of Products of Linear Polynomials (PDF, talk)
algorithms	Unknot Recognition Through Quantifier Elimination (PDF, talk)
autocorrelation	Hard Combinatorial Problems: A Challenge for Satisfiability (PDF, talk)
Automatic Proof checking	A Practical Polynomial Calculus for Arithmetic Circuit Verification (PDF, talk)
Autonomous Driving	Constraint Systems from Traffic Scenarios for the Validation of Autonomous Driving (PDF, talk)
B
Boolean polynomials	Refutation of Products of Linear Polynomials (PDF, talk)
C
CoCoA and MathSAT	New in CoCoA-5.2.4 and CoCoALib-0.99570 for SC-Square (PDF, talk)
Computer Algebra	A Practical Polynomial Calculus for Arithmetic Circuit Verification (PDF, talk)
Constraint Solving	Constraint Systems from Traffic Scenarios for the Validation of Autonomous Driving (PDF, talk)
Constraint Systems	Constraint Systems from Traffic Scenarios for the Validation of Autonomous Driving (PDF, talk)
cylindrical algebraic decomposition	Towards Incremental Cylindrical Algebraic Decomposition in Maple (PDF, talk) Evaluation of Equational Constraints for CAD in SMT Solving (PDF, talk)
D
D-optimaldesigns	Hard Combinatorial Problems: A Challenge for Satisfiability (PDF, talk)
Decision Procedures	Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT (PDF, talk)
E
Economic Reasoning	Non-linear Real Arithmetic Benchmarks derived from Automated Reasoning in Economics (PDF, talk)
equational constraints	Evaluation of Equational Constraints for CAD in SMT Solving (PDF, talk)
F
factorization	New in CoCoA-5.2.4 and CoCoALib-0.99570 for SC-Square (PDF, talk)
G
Groebner bases	New in CoCoA-5.2.4 and CoCoALib-0.99570 for SC-Square (PDF, talk)
Gröbner Basis	A Practical Polynomial Calculus for Arithmetic Circuit Verification (PDF, talk)
H
Hadamard matrices	Hard Combinatorial Problems: A Challenge for Satisfiability (PDF, talk)
I
Incremental	Towards Incremental Cylindrical Algebraic Decomposition in Maple (PDF, talk)
interval arithmetics	New in CoCoA-5.2.4 and CoCoALib-0.99570 for SC-Square (PDF, talk)
interval propagation	Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT (PDF, talk)
K
knot theory	Unknot Recognition Through Quantifier Elimination (PDF, talk)
L
linear clauses	Refutation of Products of Linear Polynomials (PDF, talk)
logic	Unknot Recognition Through Quantifier Elimination (PDF, talk)
M
Maple	SMT-like Queries in Maple (PDF, talk)
Multiplier Verification	A Practical Polynomial Calculus for Arithmetic Circuit Verification (PDF, talk)
N
Natural-style Proofs	Techniques for Natural-style Proofs in Elementary Analysis (PDF, talk)
non-linear arithmetic	Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT (PDF, talk)
Non-linear Real Arithmetic	Non-linear Real Arithmetic Benchmarks derived from Automated Reasoning in Economics (PDF, talk)
P
Polynomial Calculus	A Practical Polynomial Calculus for Arithmetic Circuit Verification (PDF, talk)
Q
quantifier elimination	Non-linear Real Arithmetic Benchmarks derived from Automated Reasoning in Economics (PDF, talk) Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT (PDF, talk)
R
real algebraic geometry	Unknot Recognition Through Quantifier Elimination (PDF, talk)
real roots	New in CoCoA-5.2.4 and CoCoALib-0.99570 for SC-Square (PDF, talk)
S
SAT solving	Refutation of Products of Linear Polynomials (PDF, talk)
Satisfiability Checking	Techniques for Natural-style Proofs in Elementary Analysis (PDF, talk)
Satisfiability Modulo Theories	Non-linear Real Arithmetic Benchmarks derived from Automated Reasoning in Economics (PDF, talk)
SATsolvers	Hard Combinatorial Problems: A Challenge for Satisfiability (PDF, talk)
SMT	Towards Incremental Cylindrical Algebraic Decomposition in Maple (PDF, talk) Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT (PDF, talk) SMT-like Queries in Maple (PDF, talk)
SMT Solving	Evaluation of Equational Constraints for CAD in SMT Solving (PDF, talk) Unknot Recognition Through Quantifier Elimination (PDF, talk)
SMTLIB	SMT-like Queries in Maple (PDF, talk)
symbolic computation	Unknot Recognition Through Quantifier Elimination (PDF, talk) Techniques for Natural-style Proofs in Elementary Analysis (PDF, talk)
T
Traffic Scenarios	Constraint Systems from Traffic Scenarios for the Validation of Autonomous Driving (PDF, talk)

Disclaimer | Powered by EasyChair Smart Program