Triemaps that match
- Computer Science
This paper presents a new approach to efficient matching for statically typed functional programming, which yields an interesting new viewpoint — and a practically useful design pattern, with good runtime performance.
First-Orderized ResearchCyc : Expressivity and Efficiency in a Common-Sense Ontology
- Computer Science
A translati on of a large part of the Cyc ontology into FirstOrder Logic is presented, indicating that, while the use of higher-order logic is not essential to the representabilit y of common-sense knowledge, it greatly improves the efficiency of reasoning.
Automated Generation of Geometry Questions for High School Mathematics
- Computer ScienceCSEDU
A framework that combines a combinatorial approach, pattern matching and automated deduction to generate and solve geometry problems for high school mathematics to help teachers to quickly generate large numbers of questions on a geometry topic is described.
Deciding expressive description logics in the framework of resolution
- Computer ScienceInf. Comput.
On Variable-inactivity and Polynomial tau-Satisfiability Procedures
- Computer ScienceJ. Log. Comput.
The generalization of the rewrite-based approach to arbitrary ground formulae and the polynomial satisfiability procedure for the theory of records with extensionality use the same key property—termed variable-inactivity—that allows one to combine theories in a simple way in the rewrite -based approach.
Symbolic Program Analysis Using Term Rewriting and Generalization
- Computer Science2008 Formal Methods in Computer-Aided Design
This work proposes a new program verification technique that addresses the problems of symbolic execution by performing a work list based analysis that handles join points, and simplifying the intermediate state representation by using term rewriting.
Encoding First Order Proofs in SAT
- Computer ScienceCADE
A method for proving rigid first order theorems by encoding them as propositional satisfiability problems, which can be useful for general first order problems, by continually adding more instances of each clause.
A tool for writing and debugging algebraic specifications
- Computer ScienceProceedings. 26th International Conference on Software Engineering
A tool that helps programmers write and debug algebraic specifications that instantiates a prototype that can be used just like any regular Java class.
A TLA+ Formal Proof of a Cross-Chain Swap
- Computer Science, MathematicsICDCN
This paper provides a formally proved Byzantine fault-tolerant protocol that satisfies the swap specification and abstracts the blockchain enough to suit various distributed ledger frameworks aiming to perform a cross-chain swap.
Formal Methods in Railways: a Systematic Mapping Study
- Computer ScienceACM Computing Surveys
The landscape of research on applications of formal methods to the development of railway systems is surveyed, highlighting the need to focus on more empirically sound research methods, such as Case Studies and Controlled Experiments, and to lower the degree of abstraction by applying formal methods and tools to development phases that are closer to software development.