67 research outputs found
Core-guided minimal correction set and core enumeration
A set of constraints is unsatisfiable if there is no solution that satisfies these constraints. To analyse unsatisfiable problems, the user needs to understand where inconsistencies come from and how they can be repaired. Minimal unsatisfiable cores and correction sets are important subsets of constraints that enable such analysis. In this work, we propose a new algorithm for extracting minimal unsatisfiable cores and correction sets simultaneously. Building on top of the relaxation and strengthening framework, we introduce novel techniques for extracting these sets. Our new solver significantly outperforms several state of the art algorithms on common benchmarks when it comes to extracting correction sets and compares favorably on core extraction.Peer ReviewedPostprint (published version
Logic-Based Explainability in Machine Learning
The last decade witnessed an ever-increasing stream of successes in Machine
Learning (ML). These successes offer clear evidence that ML is bound to become
pervasive in a wide range of practical uses, including many that directly
affect humans. Unfortunately, the operation of the most successful ML models is
incomprehensible for human decision makers. As a result, the use of ML models,
especially in high-risk and safety-critical settings is not without concern. In
recent years, there have been efforts on devising approaches for explaining ML
models. Most of these efforts have focused on so-called model-agnostic
approaches. However, all model-agnostic and related approaches offer no
guarantees of rigor, hence being referred to as non-formal. For example, such
non-formal explanations can be consistent with different predictions, which
renders them useless in practice. This paper overviews the ongoing research
efforts on computing rigorous model-based explanations of ML models; these
being referred to as formal explanations. These efforts encompass a variety of
topics, that include the actual definitions of explanations, the
characterization of the complexity of computing explanations, the currently
best logical encodings for reasoning about different ML models, and also how to
make explanations interpretable for human decision makers, among others
Investigations into Proof Structures
We introduce and elaborate a novel formalism for the manipulation and
analysis of proofs as objects in a global manner. In this first approach the
formalism is restricted to first-order problems characterized by condensed
detachment. It is applied in an exemplary manner to a coherent and
comprehensive formal reconstruction and analysis of historical proofs of a
widely-studied problem due to {\L}ukasiewicz. The underlying approach opens the
door towards new systematic ways of generating lemmas in the course of proof
search to the effects of reducing the search effort and finding shorter proofs.
Among the numerous reported experiments along this line, a proof of
{\L}ukasiewicz's problem was automatically discovered that is much shorter than
any proof found before by man or machine.Comment: This article is a continuation of arXiv:2104.1364
Recommended from our members
Physical Plan Instrumentation in Databases: Mechanisms and Applications
Database management systems (DBMSs) are designed with the goal set to compile SQL queries to physical plans that, when executed, provide results to the SQL queries. Building on this functionality, an ever-increasing number of application domains (e.g., provenance management, online query optimization, physical database design, interactive data profiling, monitoring, and interactive data visualization) seek to operate on how queries are executed by the DBMS for a wide variety of purposes ranging from debugging and data explanation to optimization and monitoring. Unfortunately, DBMSs provide little, if any, support to facilitate the development of this class of important application domains. The effect is such that database application developers and database system architects either rewrite the database internals in ad-hoc ways; work around the SQL interface, if possible, with inevitable performance penalties; or even build new databases from scratch only to express and optimize their domain-specific application logic over how queries are executed.
To address this problem in a principled manner in this dissertation, we introduce a prototype DBMS, namely, Smoke, that exposes instrumentation mechanisms in the form of a framework to allow external applications to manipulate physical plans. Intuitively, a physical plan is the underlying representation that DBMSs use to encode how a SQL query will be executed, and providing instrumentation mechanisms at this representation level allows applications to express and optimize their logic on how queries are executed.
Having such an instrumentation-enabled DBMS in-place, we then consider how to express and optimize applications that rely their logic on how queries are executed. To best demonstrate the expressive and optimization power of instrumentation-enabled DBMSs, we express and optimize applications across several important domains including provenance management, interactive data visualization, interactive data profiling, physical database design, online query optimization, and query discovery. Expressivity-wise, we show that Smoke can express known techniques, introduce novel semantics on known techniques, and introduce new techniques across domains. Performance-wise, we show case-by-case that Smoke is on par with or up-to several orders of magnitudes faster than state-of-the-art imperative and declarative implementations of important applications across domains.
As such, we believe our contributions provide evidence and form the basis towards a class of instrumentation-enabled DBMSs with the goal set to express and optimize applications across important domains with core logic over how queries are executed by DBMSs
Design and optimisation of scientific programs in a categorical language
This thesis presents an investigation into the use of advanced computer languages for scientific computing, an examination of performance issues that arise from using such languages for such a task, and a step toward achieving portable performance from compilers by attacking these problems in a way that compensates for the complexity of and differences between modern computer architectures. The language employed is Aldor, a functional language from computer algebra, and the scientific computing area is a subset of the family of iterative linear equation solvers applied to sparse systems. The linear equation solvers that are considered have much common structure, and this is factored out and represented explicitly in the lan-guage as a framework, by means of categories and domains. The flexibility introduced by decomposing the algorithms and the objects they act on into separate modules has a strong performance impact due to its negative effect on temporal locality. This necessi-tates breaking the barriers between modules to perform cross-component optimisation. In this instance the task reduces to one of collective loop fusion and array contrac
Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design – FMCAD 2021
The Conference on Formal Methods in Computer-Aided Design (FMCAD) is an annual conference on the theory and applications of formal methods in hardware and system verification. FMCAD provides a leading forum to researchers in academia and industry for presenting and discussing groundbreaking methods, technologies, theoretical results, and tools for reasoning formally about computing systems. FMCAD covers formal aspects of computer-aided system design including verification, specification, synthesis, and testing
Recommended from our members
Semantic-based framework for the generation of travel demand
Traffic and transportation have a wide-ranging impact on the daily lives of the human population and society. Activity-based travel demand generation models and traffic simulators are tools that have been developed to investigate traffic and transport problems and assist in developing solutions.
The closer modelling of human behaviour, the emergence of new technologies and the availability of more detailed datasets is leading to greater modelling complexity. The robustness of conclusions in investigations is supported by comparison of multiple techniques and models yet variations in the platform, data requirements and dataset availability present barriers to their breadth. This thesis investigates the development of a Semantic Web framework for activity-based travel demand generation.
It is proposed that the application of a knowledge-based approach and development of an orchestrating framework will enable a loosely coupled modular architecture. This approach will reduce the burden in preparing and accessing datasets through the construction of a platform-independent knowledge-base and facilitate switching between modules and datasets.
The principal contributions of this work are the application of a knowledge-based approach to travel demand generation; the development of a Semantic-based framework to control the configuration of the process and the design; and demonstration of the Semantic based framework through the implementation and evaluation of the modular travel demand generation process, including integration with two third-party traffic simulators.
The investigation found that the proposed approach can be successfully applied to model and control the travel demand generation process. Multiple configurations were explored, including utilising network communications, and found that this had a noticeable impact on execution duration but also the potential for mitigation through distributed computing.
This presents the opportunity for an online infrastructure of datasets and module implementations for travel demand generation that users can select and access through the framework. This infrastructure would remove the need for ad hoc interfaces; data format conversion or platform dependence to facilitate the process of traffic modelling becoming quicker and more robust
Internet of Things and Sensors Networks in 5G Wireless Communications
This book is a printed edition of the Special Issue Internet of Things and Sensors Networks in 5G Wireless Communications that was published in Sensors
- …