The following pages link to ASSAT (Q15063):
Displayed 50 items.
- Tableau Calculi for Logic Programs under Answer Set Semantics (Q2946700) (← links)
- On Testing Answer-Set Programs (Q2999229) (← links)
- Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses (Q3001916) (← links)
- Effectively Reasoning about Infinite Sets in Answer Set Programming (Q3001917) (← links)
- Loop Formulas for Splitable Temporal Logic Programs (Q3003245) (← links)
- A general framework for equivalences in Answer-Set Programming by countermodels in the logic of Here-and-There (Q3008405) (← links)
- (Q3011296) (← links)
- Bridging the Gap between Reinforcement Learning and Knowledge Representation: A Logical Off- and On-Policy Framework (Q3011967) (← links)
- Automatic network reconstruction using ASP (Q3087459) (← links)
- Guarded resolution for Answer Set Programming (Q3087811) (← links)
- (Q3089163) (← links)
- (Q3089164) (← links)
- (Q3100235) (← links)
- (Q3100241) (← links)
- (Q3100242) (← links)
- Implementing Prioritized Merging with ASP (Q3163981) (← links)
- Characterising equilibrium logic and nested logic programs: Reductions and complexity, (Q3181745) (← links)
- Monotonic Answer Set Programming (Q3395258) (← links)
- From (Quantified) Boolean Formulae to Answer Set Programming (Q3395260) (← links)
- The Significance of Memory Costs in Answer Set Solver Implementation (Q3395262) (← links)
- Actions Over a Constructive Semantics for Description Logics (Q3400566) (← links)
- GASP: Answer Set Programming with Lazy Grounding (Q3400569) (← links)
- (Q3413498) (← links)
- Towards automated integration of guess and check programs in answer set programming: a meta-interpreter and applications (Q3426200) (← links)
- Graphs and colorings for answer set programming (Q3426201) (← links)
- ASP Solving for Expanding Universes (Q3449219) (← links)
- Integrating Inductive Definitions in SAT (Q3498482) (← links)
- Experimenting with parallelism for the instantiation of ASP programs (Q3527693) (← links)
- Answer Set Programming: A Declarative Approach to Solving Search Problems (Q3533116) (← links)
- Extended ASP Tableaux and rule redundancy in normal logic programs (Q3546041) (← links)
- Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs (Q3546042) (← links)
- Answer Set Programming (Q3578395) (← links)
- Catching the Ouroboros: On debugging non-ground answer-set programs (Q3585165) (← links)
- Loop formulas for description logic programs (Q3585166) (← links)
- Testing and debugging techniques for answer set solver development (Q3585183) (← links)
- Thirteen Definitions of a Stable Model (Q3586017) (← links)
- Automata and Answer Set Programming (Q3605538) (← links)
- Towards Overcoming the Knowledge Acquisition Bottleneck in Answer Set Prolog Applications: Embracing Natural Language Inputs (Q3608642) (← links)
- Logic Programming for Knowledge Representation (Q3608647) (← links)
- (Q3624035) (← links)
- (Q3624060) (← links)
- Merging Belief Bases Represented by Logic Programs (Q3638164) (← links)
- Probabilistic Reasoning by SAT Solvers (Q3638188) (← links)
- An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems (Q3638568) (← links)
- Answer Set Programming: A Primer (Q3638997) (← links)
- Computing Stable Models via Reductions to Difference Logic (Q3643113) (← links)
- A First Order Forward Chaining Approach for Answer Set Computing (Q3643118) (← links)
- Simple Random Logic Programs (Q3643121) (← links)
- Max-ASP: Maximum Satisfiability of Answer Set Programs (Q3643122) (← links)
- Weight Constraint Programs with Functions (Q3643129) (← links)