Filters








30 Hits in 2.3 sec

Debugging overconstrained declarative models using unsatisfiable cores

I. Shlyakhter, R. Seater, D. Jackson, M. Sridharan, M. Taghdiri
18th IEEE International Conference on Automated Software Engineering, 2003. Proceedings.  
Declarative models, in which conjunction and negation are freely used, are susceptible to unintentional overconstraint.  ...  The unsatisfiable core is mapped back into the syntax of the original model, showing the user fragments of the model found to be irrelevant.  ...  As discussed in Section 5, 'vacuity testing' addresses this problem [15, 1, 3, 20] , but does not apply to declarative models and helps debug only overconstrained properties, not overconstrained models  ... 
doi:10.1109/ase.2003.1240298 dblp:conf/kbse/ShlyakhterSJST03 fatcat:uy7vmcigrbcc7m3myarr7x6w6y

Premise Set Caching for Enumerating Minimal Correction Subsets

Alessandro Previti, Carlos Mencía, Matti Järvisalo, Joao Marques-Silva
2018 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
Contrasting to earlier work, we move from caching unsatisfiable cores to caching PSes and propose a more effective way of implementing the cache.  ...  Methods for explaining the sources of inconsistency of overconstrained systems find an ever-increasing number of applications, ranging from diagnosis and configuration to ontology debugging and axiom pinpointing  ...  Introduction The analysis of overconstrained systems finds a wide range of important AI applications, including numerous problems of diagnosis, such as type debugging (Stuckey, Sulzmann, and Wazny 2003  ... 
doi:10.1609/aaai.v32i1.12213 fatcat:qq5ievgvozbuve2jgwx7aelxr4

Debugging for Model Expansion [chapter]

Johan Wittocx, Hanne Vlaeminck, Marc Denecker
2009 Lecture Notes in Computer Science  
Due to the development of efficient solvers, declarative problem solving frameworks based on model generation are becoming more and more applicable in practice.  ...  In this paper, we propose a new solver algorithm for one of these frameworks, namely Model Expansion, that allows for debugging by tracing.  ...  The alloy system [1] is a model expansion system for a syntactic variant of FO. In [19] , a debugging method for overconstrained (hence unsatisfiable) instances was presented.  ... 
doi:10.1007/978-3-642-02846-5_26 fatcat:z5uer3oklbbynm3ovrl6pclyky

Applications and extensions of Alloy: past, present and future

EMINA TORLAK, MANA TAGHDIRI, GREG DENNIS, JOSEPH P. NEAR
2013 Mathematical Structures in Computer Science  
Alloy is a declarative language for lightweight modelling and analysis of software.  ...  The core of the language is based on first-order relational logic, which offers an attractive balance between analysability and expressiveness.  ...  Otherwise, the tool outputs a minimal unsatisfiable core of the memory model and program constraints.  ... 
doi:10.1017/s0960129512000291 fatcat:hudzt55aznerld3v4uwwz46f5i

Cause clue clauses

Manu Jose, Rupak Majumdar
2011 SIGPLAN notices  
First, using bounded model checking, and a bound obtained from the execution of the test, we encode the semantics of a bounded unrolling of the program as a Boolean trace formula.  ...  ., one that violates an assertion or a post-condition), we construct an unsatisfiable formula by taking the formula and additionally asserting that the input is the failing test and that the assertion  ...  Unsatisfiability cores have also been used to localize overconstrains in declarative models [26] . The program has a bug.  ... 
doi:10.1145/1993316.1993550 fatcat:q2ds4v3wvfbnbls2hzagnm6vvu

Solver-Based Sketching of Alloy Models Using Test Valuations [chapter]

Kaiyuan Wang, Allison Sullivan, Darko Marinov, Sarfraz Khurshid
2018 Lecture Notes in Computer Science  
and functional programs to declarative, relational logic.  ...  Alloy users routinely use the valuations to validate their models: enumerate some valuations and inspect them to detect underconstraints or overconstraints.  ...  While this paper focuses on sketching for Alloy, one of the earliest approaches for helping Alloy users build their models correctly was based on identifying unsatisfiable cores in overconstrained models  ... 
doi:10.1007/978-3-319-91271-4_9 fatcat:5hkn5kaevze33abvs4d7ymex5i

The power of "why" and "why not": enriching scenario exploration with provenance

Tim Nelson, Natasha Danas, Daniel J. Dougherty, Shriram Krishnamurthi
2017 Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering - ESEC/FSE 2017  
Scenario-finding tools like the Alloy Analyzer are widely used in numerous concrete domains like security, network analysis, UML analysis, and so on.  ...  CCS CONCEPTS • Software and its engineering → Formal methods; KEYWORDS Model finding, formal methods, provenance, Alloy analyzer ACM Reference format:  ...  This work was partially supported by the US NSF.  ... 
doi:10.1145/3106237.3106272 dblp:conf/sigsoft/NelsonDDK17 fatcat:hzsio7nbmncsfbnlh3bvirxg5q

Constraint-based document layout for the Web

Alan Borning, Richard Kuang-Hsu Lin, Kim Marriott
2000 Multimedia Systems  
Constraints can be used to specify declaratively the desired layout of a web document.  ...  A solution to this problem is to use constraints to specify the core aspects of the design layout.  ...  A related issue concerns debugging.  ... 
doi:10.1007/s005300000043 fatcat:3uba7bjds5hbdlopmvd7nu6mzi

Constraint Modelling: A Challenge for First Order Automated Reasoning (Invited Talk)

John K. Slaney
2008 Conference on Automated Deduction  
Contemporary modelling languages separate the first order description or "model" from its grounding instantiation or "data".  ...  In this talk, I survey the opportunities arising from this new application direction for automated deduction, and note some of the formidable obstacles in the way of a practically useful implementation  ...  A traditional debugging move, also useful in the other cases of inconsistency, is to find and present a [near] minimal inconsistent core: that is, a minimally inconsistent subset of the constraints.  ... 
dblp:conf/cade/Slaney08 fatcat:an6uqbvbfvhpfmazobkpyhpevu

Constraint Modelling: A Challenge for First Order Automated Reasoning

Peter Baumgartner, John Slaney
2009 International Workshops on First Order Theorem Proving  
While the opportunities presented by reasoning about constraint models are indeed exciting, we also find that there are formidable obstacles in the way of a practically useful implementation. ⋆ NICTA is  ...  Cadoli et al [BCM04, MC05, CM04] noted the potential of first order automated reasoning for the purpose of analysing constraint models, and reported some encouraging initial experimental results.  ...  A traditional debugging move, also useful in the other cases of inconsistency, is to find and present a [near] minimal inconsistent core: that is, a minimally inconsistent subset of the constraints.  ... 
dblp:conf/ftp/BaumgartnerS09 fatcat:tayozrojdzfmbkbj73jc2dt66q

Structural types for systems of equations

John Capper, Henrik Nilsson
2012 Higher-Order and Symbolic Computation  
The type system presented in this paper is developed in the context of Functional Hybrid Modelling (FHM).  ...  This information can then be used to determine if individual fragments are well formed, and if composing fragments preserves this property.  ...  However, it is then unclear how best to communicate type errors resulting from unsatisfiable constraints to the modeller.  ... 
doi:10.1007/s10990-013-9099-6 fatcat:zb5gpxua55d7dj5ktpci5bkbf4

Nitpicking c++ concurrency

Jasmin Christian Blanchette, Tjark Weber, Mark Batty, Scott Owens, Susmit Sarkar
2011 Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming - PPDP '11  
. • They can be used in conjunction with lightweight formal methods, such as model checkers and model finders, to explore the consequences of the specification.  ...  Here we employ the model finder Nitpick to check litmus test programs that exercise the memory model, including a simple locking algorithm.  ...  Acknowledgments This work would not have been possible without Peter Sewell, who together with the last four authors specified the C++ memory model in Isabelle/HOL.  ... 
doi:10.1145/2003476.2003493 dblp:conf/ppdp/BlanchetteWBOS11 fatcat:qv5ktwhmdfc4flhw7iytvisddm

Cost-optimal constrained correlation clustering via weighted partial Maximum Satisfiability

Jeremias Berg, Matti Järvisalo
2017 Artificial Intelligence  
We also investigate the effects of MaxSAT-level preprocessing, symmetry breaking, and the choice of the MaxSAT solver on the efficiency of the approach. providing the MaxHS solver version used in the experiments  ...  These subsets are commonly referred to as unsatisfiable cores [52, 47, 54] .  ...  During its execution, MaxHS maintains a set of unsatisfiable cores (recall Section 5.2).  ... 
doi:10.1016/j.artint.2015.07.001 fatcat:sx5xwpegtngu7oa7osd3eilwyu

Automated synthesis and debugging of declarative models in alloy [article]

Kaiyuan Wang
2018
AlloyFL un is designed to simulate how Alloy users would debug a faulty model manually using the unsat core.  ...  Fault Localization Automated debugging of Alloy models can be traced back to Alloy's early days when highlighting unsat cores in unsatisfiable Alloy formulas was introduced [120] .  ...  For example, dll3 models a property using a single quantifier, but the model needs two. stu2 has a formula with the structure (α ⇒ β) || γ, but the correct fix requires α⇒β else γ, where α, β and γ are  ... 
doi:10.15781/t2z60cn6s fatcat:7dkyg2hqk5hjrk3egzkz6mcrxq

On Tackling Explanation Redundancy in Decision Trees [article]

Yacine Izza, Alexey Ignatiev, Joao Marques-Silva
2022 arXiv   pre-print
The interpretability of decision trees motivates explainability approaches by so-called intrinsic interpretability, and it is at the core of recent proposals for applying interpretable ML models in high-risk  ...  Decision trees (DTs) epitomize the ideal of interpretability of machine learning (ML) models.  ...  A formula ϕ is satisfiable if there exists a truth assignment that satisfies ϕ; otherwise it is unsatisfiable (or overconstrained, or inconsistent).  ... 
arXiv:2205.09971v1 fatcat:euhzw4y3bndnziymr6onfaw24u
« Previous Showing results 1 — 15 out of 30 results