More Like this

1. SMT-based Constraint Answer Set Solver EZSMT+ for Non-tight Programs

   Shen, D. ( January 2018 , 16th International Conference on Principles of Knowledge Representation and Reasoning (KR))
2. DyCL: Dynamic Neural Network Compilation Via Program Rewriting and Graph Optimization

   https://doi.org/10.1145/3597926.3598082  

   Chen, Simin ; Wei, Shiyi ; Liu, Cong ; Yang, Wei ( July 2023 , ACM)
3. Improving Unsupervised Visual Program Inference with Code Rewriting Families

   https://doi.org/10.1109/ICCV51070.2023.01447  

   Ganeshan, Aditya ; Jones, R. Kenny ; Ritchie, Daniel ( October 2023 , Proceedings of the International Conference on Computer Vision)
4. Leveraging Large Language Models to Generate Answer Set Programs

   https://doi.org/10.24963/kr.2023/37  

   Ishay, Adam ; Yang, Zhun ; Lee, Joohyung ( September 2023 , International Joint Conferences on Artificial Intelligence Organization)

   Large language models (LLMs), such as GPT-3 and GPT-4, have demonstrated exceptional performance in various natural language processing tasks and have shown the ability to solve certain reasoning problems. However, their reasoning capabilities are limited and relatively shallow, despite the application of various prompting techniques. In contrast, formal logic is adept at handling complex reasoning, but translating natural language descriptions into formal logic is a challenging task that non-experts struggle with. This paper proposes a neuro-symbolic method that combines the strengths of large language models and answer set programming. Specifically, we employ an LLM to transform natural language descriptions of logic puzzles into answer set programs. We carefully design prompts for an LLM to convert natural language descriptions into answer set programs in a step by step manner. Surprisingly, with just a few in-context learning examples, LLMs can generate reasonably complex answer set programs. The majority of errors made are relatively simple and can be easily corrected by humans, thus enabling LLMs to effectively assist in the creation of answer set programs. 

   more » « less
5. ASPER: Answer Set Programming Enhanced Neural Network Models for Joint Entity-Relation Extraction

   https://doi.org/10.1017/s1471068423000297  

   LE, TRUNG HOANG ; CAO, HUIPING ; CAO SON, TRAN ( January 2023 , Theory and Practice of Logic Programming)

   Abstract A plethora of approaches have been proposed for joint entity-relation (ER) extraction. Most of these methods largely depend on a large amount of manually annotated training data. However, manual data annotation is time-consuming, labor-intensive, and error-prone. Human beings learn using both data (through induction) and knowledge (through deduction). Answer Set Programming (ASP) has been a widely utilized approach for knowledge representation and reasoning that is elaboration tolerant and adept at reasoning with incomplete information. This paper proposes a new approach, ASP-enhanced Entity-Relation extraction (ASPER), to jointly recognize entities and relations by learning from both data and domain knowledge. In particular, ASPER takes advantage of the factual knowledge (represented as facts in ASP) and derived knowledge (represented as rules in ASP) in the learning process of neural network models. We have conducted experiments on two real datasets and compare our method with three baselines. The results show that our ASPER model consistently outperforms the baselines. 

   more » « less