The following pages link to (Q4702577):
Displaying 41 items.
- Stepwise debugging of answer-set programs (Q4603428) (← links)
- Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs (Q4649731) (← links)
- On the expressibility of stable logic programming (Q4815033) (← links)
- On the Coincidence of Semantics for Uniquely Determined Programs (Q4923373) (← links)
- The Seventh Answer Set Programming Competition: Design and Results (Q4957192) (← links)
- A Logic-Based Framework Leveraging Neural Networks for Studying the Evolution of Neurological Disorders (Q4957216) (← links)
- Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search (Q4988946) (← links)
- (Q5020651) (← links)
- (Q5020971) (← links)
- (Q5020979) (← links)
- (Q5020982) (← links)
- Strong Equivalence of Logic Programs with Counting (Q5038462) (← links)
- (Q5087786) (← links)
- Abstract Solvers for Computing Cautious Consequences of ASP programs (Q5108499) (← links)
- Revisiting Explicit Negation in Answer Set Programming (Q5108509) (← links)
- Modular Answer Set Programming as a Formal Specification Language (Q5140013) (← links)
- Reasoning about Cardinal Directions between 3-Dimensional Extended Objects using Answer Set Programming (Q5140026) (← links)
- Explanation Generation for Multi-Modal Multi-Agent Path Finding with Optimal Resource Utilization using Answer Set Programming (Q5140029) (← links)
- Formalizing Negotiations Using Logic Programming (Q5169968) (← links)
- Explaining Preferences and Preferring Explanations (Q5172617) (← links)
- An Answer Set Programming Framework for Reasoning About Truthfulness of Statements by Agents. (Q5240213) (← links)
- A compositional typed higher-order logic with definitions (Q5240216) (← links)
- Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs (Q5240230) (← links)
- Model-Based Knowledge Representation and Reasoning Via Answer Set Programming (Q5458423) (← links)
- Building a Knowledge Base System for an Integration of Logic Programming and Classical Logic (Q5504646) (← links)
- SMS and ASP: Hype or TST? (Q5504647) (← links)
- Quo Vadis Answer Set Programming? (Q5504648) (← links)
- Answer Set Programming without Unstratified Negation (Q5504649) (← links)
- Detecting Inconsistencies in Large Biological Networks with Answer Set Programming (Q5504653) (← links)
- Computable Functions in ASP: Theory and Implementation (Q5504670) (← links)
- Relativized Hyperequivalence of Logic Programs for Modular Programming (Q5504681) (← links)
- Using answer set programming to deal with Boolean networks and attractor computation: application to gene regulatory networks of cells (Q6059225) (← links)
- FOLASP<i>: FO(·) as Input Language for Answer Set Solvers</i> (Q6063868) (← links)
- Modeling and Reasoning in Event Calculus using Goal-Directed Constraint Answer Set Programming (Q6063873) (← links)
- Fifty Years of Prolog and Beyond (Q6063890) (← links)
- Thirty years of Epistemic Specifications (Q6085582) (← links)
- Qualitative reasoning about 2D cardinal directions using answer set programming (Q6488805) (← links)
- Scalable neural-probabilistic answer set programming (Q6535415) (← links)
- Plan selection framework for policy-aware autonomous agents (Q6545571) (← links)
- Computationally hard problems for logic programs under answer set semantics (Q6636616) (← links)
- IASCAR: incremental answer set counting by anytime refinement (Q6656460) (← links)
