home.social

#booleansatisfiability — Public Fediverse posts

Live and recent posts from across the Fediverse tagged #booleansatisfiability, aggregated by home.social.

  1. Survey of Theme One Program • 6
    inquiryintoinquiry.com/2024/02

    This is a Survey of resources for the Theme One Program I worked on all through the 1980s. The aim was to develop fundamental algorithms and data structures for integrating empirical learning with logical reasoning. I had earlier developed separate programs for basic components of those tasks, namely, two‑level formal language learning and propositional constraint satisfaction, the latter using an extension of C.S. Peirce's logical graphs as a syntax for propositional logic. Thus arose the question of how well it might be possible to get “empiricist” and “rationalist” modes of operation to cooperate. The long-term vision is the design and implementation of an Automated Research Tool able to double as a platform for Inquiry Driven Education.

    Please follow the above link for the full set of resources.
    A collection of articles on the core ideas is linked below.

    Wiki Hub —

    Theme One Program • Overview
    oeis.org/wiki/Theme_One_Progra

    Documentation —

    Theme One Program • Pascal Source Code
    academia.edu/5210987/Theme_One

    Theme One Program • User Guide
    academia.edu/5211369/Theme_One

    Theme One Program • Exposition
    oeis.org/wiki/Theme_One_Progra

    Applications —

    Applications of a Propositional Calculator • Constraint Satisfaction Problems
    academia.edu/4727842/Applicati

    Exploratory Qualitative Analysis of Sequential Observation Data
    oeis.org/wiki/User:Jon_Awbrey/

    References —

    An Architecture for Inquiry • Building Computer Platforms for Discovery
    academia.edu/1270327/An_Archit

    Exploring Research Data Interactively • Theme One : A Program of Inquiry
    academia.edu/1272839/Exploring

    #Peirce #Logic #LogicalGraphs #ThemeOneProgram
    #BooleanSatisfiability #DeclarativeProgramming

  2. CW: Shameless promo of my talk

    Excited to be presenting "Solving the Identifying Code Set Problem with Grouped Independent Support" at 11:45 in Almaty 6007 (CSO Constraint Programming session) today at IJCAI!

    If you cannot make it to my presentation, no worries! You can check out the slides or my poster, or come talk to me during the poster session at the end of the day 🤓

    paper: ijcai.org/proceedings/2023/021

    slides: raw.githubusercontent.com/lato

    poster: raw.githubusercontent.com/lato

    #IJCAI2023 #IJCAI #PostdocLife #BooleanSatisfiability #ConstraintProgramming #CombinatorialOptimisation #ConstraintOptimisation #AcademicMastodon #AcademicChatter

  3. Very happy that our paper "Solving the Identifying Code Set Problem with Grouped Independent Support" was accepted to IJCAI 2023!

    I did this work together with Prof. Kuldeep Meel and from NUS and Prof. Arunabha Sen from ASU. It was a great pleasure to work with them, and I learned a lot from both of them during this project. We have some ideas for further research, so I hope this story is to be continued...

    Shout-out and many thanks to @msoos for his last-minute help to fix a bug in the code!

    This is my first accepted conference paper that I worked on without my PhD advisor Dr. Siegfried Nijssen Dr. Behrouz Babaki. It felt a little bit weird doing this without them, but I guess that's part of the job.

    Many thanks to everyone who contributed to this work in conversation, encouragement, feedback, or just simply making our office a nice place to work at 🙂

    If you're planning to attend IJCAI in Macau, and want to meet up, let me know!

    #IJCAI #IJCAI2023 #AcademicMastodon #AcademicChatter #PostdocLife #ArtificialIntelligence #AI #CombinatorialOptimisation #BooleanSatisfiability

  4. Survey of Theme One Program
    inquiryintoinquiry.com/2023/03

    This is a Survey of resources for the Theme One Program I worked on all through the 1980s. The aim was to develop fundamental algorithms and data structures for integrating empirical learning with logical reasoning. I had earlier developed separate programs for basic components of those tasks, namely, 2-level formal language learning and propositional constraint satisfaction, the latter using an extension of C.S. Peirce's logical graphs as a syntax for propositional logic. Thus arose the question of how well it might be possible to get “empiricist” and “rationalist” modes of operation to cooperate. The long-term vision is the design and implementation of an Automated Research Tool able to double as a platform for Inquiry Driven Education.

    Please follow the above link for the full set of resources. An initial sample is linked below.

    Wiki Hub —

    Theme One Program • Overview
    oeis.org/wiki/Theme_One_Progra

    Documentation —

    Theme One Program • Pascal Source Code
    academia.edu/5210987/Theme_One

    Theme One Program • User Guide
    academia.edu/5211369/Theme_One

    Theme One Program • Exposition
    oeis.org/wiki/Theme_One_Progra

    Applications —

    Applications of a Propositional Calculator • Constraint Satisfaction Problems
    academia.edu/4727842/Applicati

    Exploratory Qualitative Analysis of Sequential Observation Data
    oeis.org/wiki/User:Jon_Awbrey/

    References —

    An Architecture for Inquiry • Building Computer Platforms for Discovery
    academia.edu/1270327/An_Archit

    Exploring Research Data Interactively • Theme One : A Program of Inquiry
    academia.edu/1272839/Exploring

    #Peirce #Logic #LogicalGraphs #ThemeOneProgram #IdeaProcessor
    #BooleanSatisfiability #CactusLanguage #DeclarativeProgramming

  5. The results of the 2022 Model Counting competition have been published! github.com/msoos/model-countin

    Thanks to Markus Hecher and Johannes Fichte for organising, and thanks to @msoos for uploading.

    Now go play with those data and improve your counters!

    #PropositionalModelCounting #ModelCounting #BeyondNP #AI #BooleanSatisfiability #FormalMethods #ArtificialIntelligence #Reasoning #Counting #ModelCounting