{"total":115,"rows":[{"id":"2105.10830","title":"Learning First-Order Representations for Planning from Black-Box States: New Results","created":"2021-05-23","cited_by_count":23,"area":null},{"id":"2503.00870","title":"NeSyC: A Neuro-symbolic Continual Learner For Complex Embodied Tasks In Open Domains","created":"2025-03-02","cited_by_count":15,"area":null},{"id":"2112.14603","title":"Learning Higher-Order Programs without Meta-Interpretive Learning","created":"2021-12-29","cited_by_count":14,"area":null},{"id":"2202.05793","title":"Answer Set Planning: A Survey","created":"2022-02-11","cited_by_count":12,"area":null},{"id":"2203.14852","title":"Learning Sketches for Decomposing Planning Problems into Subproblems of Bounded Width: Extended Version","created":"2022-03-28","cited_by_count":12,"area":null},{"id":"2209.02650","title":"Learning Interpretable Temporal Properties from Positive Examples Only","created":"2022-09-06","cited_by_count":12,"area":null},{"id":"2307.00928","title":"Learning Differentiable Logic Programs for Abstract Visual Reasoning","created":"2023-07-03","cited_by_count":12,"area":"lr"},{"id":"2104.14426","title":"Predicate Invention by Learning From Failures","created":"2021-04-29","cited_by_count":9,"area":null},{"id":"2210.03553","title":"Treewidth-aware Reductions of Normal ASP to SAT -- Is Normal ASP Harder than SAT after All?","created":"2022-10-07","cited_by_count":8,"area":null},{"id":"2301.07550","title":"Logic programming for deliberative robotic task planning","created":"2023-01-18","cited_by_count":8,"area":null},{"id":"2103.08391","title":"Flexible FOND Planning with Explicit Fairness Assumptions","created":"2021-03-15","cited_by_count":6,"area":null},{"id":"2109.08662","title":"Aggregate Semantics for Propositional Answer Set Programs","created":"2021-09-17","cited_by_count":5,"area":null},{"id":"2301.07629","title":"Generalisation Through Negation and Predicate Invention","created":"2023-01-18","cited_by_count":5,"area":null},{"id":"2502.16757","title":"Entailment-Preserving First-order Logic Representations in Natural Language Entailment","created":"2025-02-24","cited_by_count":5,"area":null},{"id":"2508.03366","title":"A Comparative Study of Neurosymbolic AI Approaches to Interpretable Logical Reasoning","created":"2025-08-05","cited_by_count":4,"area":"lr"},{"id":"2509.16590","title":"Question Answering with LLMs and Learning from Answer Sets","created":"2025-09-20","cited_by_count":4,"area":"lr"},{"id":"2512.17093","title":"A Solver-in-the-Loop Framework for Improving LLMs on Answer Set Programming for Logic Puzzle Solving","created":"2025-12-18","cited_by_count":4,"area":null},{"id":"2205.07537","title":"Decomposition Strategies and Multi-shot ASP Solving for Job-shop Scheduling","created":"2022-05-16","cited_by_count":3,"area":null},{"id":"2212.09077","title":"Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling","created":"2022-12-18","cited_by_count":3,"area":null},{"id":"2301.09833","title":"Solving Quantum-Inspired Perfect Matching Problems via Tutte's Theorem-Based Hybrid Boolean Constraints","created":"2023-01-24","cited_by_count":3,"area":null},{"id":"2308.02944","title":"dPASP: A Comprehensive Differentiable Probabilistic Answer Set Programming Environment For Neurosymbolic Learning and Reasoning","created":"2023-08-05","cited_by_count":3,"area":"lr"},{"id":"2312.11651","title":"Bridging Logic and Learning: A Neural-Symbolic Approach for Enhanced Reasoning in Neural Models (ASPER)","created":"2023-12-18","cited_by_count":3,"area":"lr"},{"id":"2405.11250","title":"Argumentative Causal Discovery","created":"2024-05-18","cited_by_count":3,"area":null},{"id":"2406.03367","title":"CLMASP: Coupling Large Language Models with Answer Set Programming for Robotic Task Planning","created":"2024-06-05","cited_by_count":3,"area":"lr"},{"id":"2503.05439","title":"An Empirical Study of Conformal Prediction in LLM with ASP Scaffolds for Robust Reasoning","created":"2025-03-07","cited_by_count":3,"area":"lr"},{"id":"2101.10162","title":"Solving a Multi-resource Partial-ordering Flexible Variant of the Job-shop Scheduling Problem with Hybrid ASP","created":"2021-01-25","cited_by_count":2,"area":null},{"id":"2108.02797","title":"I-DLV-sr: A Stream Reasoning System based on I-DLV","created":"2021-08-05","cited_by_count":2,"area":null},{"id":"2109.14883","title":"Process discovery on deviant traces and other stranger things","created":"2021-09-30","cited_by_count":2,"area":null},{"id":"2202.00343","title":"Interactive configurator with FO(.) and IDP-Z3","created":"2022-02-01","cited_by_count":2,"area":null},{"id":"2204.11902","title":"Learning First-Order Symbolic Planning Representations That Are Grounded","created":"2022-04-25","cited_by_count":2,"area":null},{"id":"2209.09066","title":"Specifying and Exploiting Non-Monotonic Domain-Specific Declarative Heuristics in Answer Set Programming","created":"2022-09-19","cited_by_count":2,"area":null},{"id":"2305.07763","title":"Knowledge Authoring for Rules and Actions","created":"2023-05-12","cited_by_count":2,"area":null},{"id":"2305.11969","title":"Logic-Based Benders Decomposition in Answer Set Programming for Chronic Outpatients Scheduling","created":"2023-05-19","cited_by_count":2,"area":null},{"id":"2401.02153","title":"Unit Testing in ASP Revisited: Language and Test-Driven Development Environment","created":"2024-01-04","cited_by_count":2,"area":null},{"id":"2402.06608","title":"TIC: Translate-Infer-Compile for accurate \"text to plan\" using LLMs and Logical Representations","created":"2024-02-09","cited_by_count":2,"area":null},{"id":"2405.09415","title":"On the Correspondence of Non-flat Assumption-based Argumentation and Logic Programming with Negation as Failure in the Head","created":"2024-05-15","cited_by_count":2,"area":null},{"id":"2502.09222","title":"ASP-driven User-interaction with Clinguin","created":"2025-02-13","cited_by_count":2,"area":null},{"id":"2512.03931","title":"Autonomous Agents and Policy Compliance: A Framework for Reasoning About Penalties","created":"2025-12-03","cited_by_count":2,"area":null},{"id":"2601.03850","title":"Investigating the Grounding Bottleneck for a Large-Scale Configuration Problem: Existing Tools and Constraint-Aware Guessing","created":"2026-01-07","cited_by_count":2,"area":null},{"id":"2602.05625","title":"Reactive Knowledge Representation and Asynchronous Reasoning","created":"2026-02-05","cited_by_count":2,"area":null},{"id":"2108.04020","title":"FOLASP: FO(.) as Input Language for Answer Ser Solvers","created":"2021-08-09","cited_by_count":1,"area":null},{"id":"2108.05165","title":"Stable Marriage Problems with Ties and Incomplete Preferences: An Empirical Comparison of ASP, SAT, ILP, CP, and Local Search Methods","created":"2021-08-11","cited_by_count":1,"area":null},{"id":"2111.06366","title":"Answer Set Programming Made Easy","created":"2021-11-11","cited_by_count":1,"area":null},{"id":"2207.08599","title":"Applying Incremental Answer Set Solving to Product Configuration","created":"2022-07-18","cited_by_count":1,"area":null},{"id":"2305.19212","title":"Solving Projected Model Counting by Utilizing Treewidth and its Limits","created":"2023-05-30","cited_by_count":1,"area":null},{"id":"2307.15453","title":"From Probabilistic Programming to Complexity-based Programming","created":"2023-07-28","cited_by_count":1,"area":null},{"id":"2308.06411","title":"Dialogue Possibilities between a Human Supervisor and UAM Air Traffic Management: Route Alteration","created":"2023-08-11","cited_by_count":1,"area":null},{"id":"2402.03663","title":"Symbol Correctness in Deep Neural Networks Containing Symbolic Layers","created":"2024-02-06","cited_by_count":1,"area":"lr"},{"id":"2405.11305","title":"Large Neighborhood Prioritized Search for Combinatorial Optimization with Answer Set Programming","created":"2024-05-18","cited_by_count":1,"area":null},{"id":"2405.13715","title":"Traffic Scenario Logic: A Spatial-Temporal Logic for Modeling and Reasoning of Urban Traffic Scenarios","created":"2024-05-22","cited_by_count":1,"area":null},{"id":"2408.07510","title":"Dominating Set Reconfiguration with Answer Set Programming","created":"2024-08-14","cited_by_count":1,"area":null},{"id":"2412.17143","title":"ASP-based Multi-shot Reasoning via DLV2 with Incremental Grounding","created":"2024-12-22","cited_by_count":1,"area":null},{"id":"2502.11733","title":"Plant in Cupboard, Orange on Rably, Inat Aphone. Benchmarking Incremental Learning of Situation and Language Model using a Text-Simulated Situated Environment","created":"2025-02-17","cited_by_count":1,"area":null},{"id":"2503.19762","title":"Splitting Answer Set Programs with respect to Intensionality Statements (Extended Version)","created":"2025-03-25","cited_by_count":1,"area":null},{"id":"2506.14577","title":"Object-Centric Neuro-Argumentative Learning","created":"2025-06-17","cited_by_count":1,"area":null},{"id":"2506.18056","title":"Weighted Assumption Based Argumentation to reason about ethical principles and actions","created":"2025-06-22","cited_by_count":1,"area":null},{"id":"2507.15478","title":"The Constitutional Controller: Doubt-Calibrated Steering of Compliant Agents","created":"2025-07-21","cited_by_count":1,"area":null},{"id":"2507.21027","title":"Smart Expansion Techniques for ASP-based Interactive Configuration","created":"2025-07-28","cited_by_count":1,"area":null},{"id":"2508.00005","title":"Modelling Program Spaces in Program Synthesis with Constraints","created":"2025-07-10","cited_by_count":1,"area":null},{"id":"2601.02850","title":"Sample-Efficient Neurosymbolic Deep Reinforcement Learning","created":"2026-01-06","cited_by_count":1,"area":"deeprl"},{"id":"2602.16481","title":"Leveraging Large Language Models for Causal Discovery: a Constraint-based, Argumentation-driven Approach","created":"2026-02-18","cited_by_count":1,"area":null},{"id":"2106.10946","title":"Defeasible Reasoning via Datalog$^\\neg$","created":"2021-06-21","cited_by_count":0,"area":null},{"id":"2109.08279","title":"Automata Techniques for Temporal Answer Set Programming","created":"2021-09-17","cited_by_count":0,"area":null},{"id":"2109.10633","title":"Reactive Answer Set Programming","created":"2021-09-22","cited_by_count":0,"area":null},{"id":"2303.13191","title":"Extended High Utility Pattern Mining: An Answer Set Programming Based Framework and Applications","created":"2023-03-23","cited_by_count":0,"area":null},{"id":"2305.02442","title":"Tackling Universal Properties of Minimal Trap Spaces of Boolean Networks","created":"2023-05-03","cited_by_count":0,"area":null},{"id":"2305.16203","title":"Computing Universal Plans for Partially Observable Multi-Agent Routing Using Answer Set Programming","created":"2023-05-25","cited_by_count":0,"area":null},{"id":"2307.10688","title":"Bounded Combinatorial Reconfiguration with Answer Set Programming","created":"2023-07-20","cited_by_count":0,"area":null},{"id":"2307.14799","title":"Hybrid ASP-based multi-objective scheduling of semiconductor manufacturing processes (Extended version)","created":"2023-07-27","cited_by_count":0,"area":null},{"id":"2307.15451","title":"DELPHIC: Practical DEL Planning via Possibilities (Extended Version)","created":"2023-07-28","cited_by_count":0,"area":null},{"id":"2308.15863","title":"Inductive Learning of Declarative Domain-Specific Heuristics for ASP","created":"2023-08-30","cited_by_count":0,"area":null},{"id":"2312.04249","title":"Extending Answer Set Programming with Rational Numbers","created":"2023-12-07","cited_by_count":0,"area":null},{"id":"2405.15794","title":"Finite Groundings for ASP with Functions: A Journey through Consistency","created":"2024-05-08","cited_by_count":0,"area":null},{"id":"2407.12605","title":"Continuous reasoning for adaptive container image distribution in the cloud-edge continuum","created":"2024-07-17","cited_by_count":0,"area":null},{"id":"2408.08150","title":"Winning Snake: Design Choices in Multi-Shot ASP","created":"2024-08-15","cited_by_count":0,"area":null},{"id":"2408.11371","title":"Solving Decision Theory Problems with Probabilistic Answer Set Programming","created":"2024-08-21","cited_by_count":0,"area":null},{"id":"2409.09485","title":"Enumerating Minimal Unsatisfiable Cores of LTLf formulas","created":"2024-09-14","cited_by_count":0,"area":null},{"id":"2410.22130","title":"Solving Epistemic Logic Programs using Generate-and-Test with Propagation","created":"2024-10-29","cited_by_count":0,"area":null},{"id":"2411.04243","title":"ION-C: Integration of Overlapping Networks via Constraints","created":"2024-11-06","cited_by_count":0,"area":null},{"id":"2412.10152","title":"Direct Encoding of Declare Constraints in ASP","created":"2024-12-13","cited_by_count":0,"area":null},{"id":"2506.06739","title":"Honey, I shrunk the hypothesis space (through logical preprocessing)","created":"2025-06-07","cited_by_count":0,"area":null},{"id":"2506.19573","title":"Interpretable Hybrid Machine Learning Models Using FOLD-R++ and Answer Set Programming","created":"2025-06-24","cited_by_count":0,"area":null},{"id":"2507.11150","title":"Fine-grained Timing Analysis of Digital Integrated Circuits in Answer Set Programming","created":"2025-07-15","cited_by_count":0,"area":null},{"id":"2507.20703","title":"A General Framework for Dynamic MAPF using Multi-Shot ASP and Tunnels","created":"2025-07-28","cited_by_count":0,"area":null},{"id":"2507.22774","title":"ASP-FZN: A Translation-based Constraint Answer Set Solver","created":"2025-07-30","cited_by_count":0,"area":null},{"id":"2508.06263","title":"Symmetry breaking for inductive logic programming","created":"2025-08-08","cited_by_count":0,"area":null},{"id":"2508.08633","title":"Diminution: On Reducing the Size of Grounding ASP Programs","created":"2025-08-12","cited_by_count":0,"area":null},{"id":"2510.07069","title":"Inductive Learning for Possibilistic Logic Programs Under Stable Models","created":"2025-10-08","cited_by_count":0,"area":null},{"id":"2512.08833","title":"Interpolation in Knowledge Representation","created":"2025-12-09","cited_by_count":0,"area":null},{"id":"2601.00877","title":"LearnAD: Learning Interpretable Rules for Brain Networks in Alzheimer's Disease Classification","created":"2025-12-30","cited_by_count":0,"area":null},{"id":"2602.01171","title":"ASP-Bench: From Natural Language to Logic Programs","created":"2026-02-01","cited_by_count":0,"area":null},{"id":"2602.03467","title":"The Dual Role of Abstracting over the Irrelevant in Symbolic Explanations: Cognitive Effort vs. Understanding","created":"2026-02-03","cited_by_count":0,"area":null},{"id":"2603.09455","title":"Declarative Scenario-based Testing with RoadLogic","created":"2026-03-10","cited_by_count":0,"area":null},{"id":"2603.18495","title":"Cross-Domain Demo-to-Code via Neurosymbolic Counterfactual Reasoning","created":"2026-03-19","cited_by_count":0,"area":"lr"},{"id":"2603.26863","title":"EZASP - Facilitating the Usage of ASP","created":"2026-03-27","cited_by_count":0,"area":null},{"id":"2604.19251","title":"Streamliners for Answer Set Programming","created":"2026-04-21","cited_by_count":0,"area":null},{"id":"2604.21603","title":"Using ASP(Q) to Handle Inconsistent Prioritized Data","created":"2026-04-23","cited_by_count":0,"area":null},{"id":"2604.21793","title":"Inferring High-Level Events from Timestamped Data: Complexity and Medical Applications","created":"2026-04-23","cited_by_count":0,"area":null},{"id":"2604.25512","title":"CoGReV: A Confidence-Gated Post-Hoc Non-Monotonic Belief Revision Framework for Phishing Website Classification","created":"2026-04-28","cited_by_count":0,"area":null},{"id":"2605.22716","title":"Parametric Modular Answer Set Programs Made Declarative","created":"2026-05-21","cited_by_count":0,"area":null}],"next_cursor":"100"}