FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

This page contains an index consisting of author-provided keywords.

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

Disclaimer | Powered by EasyChair Smart Program