ASSAT
From MaRDI portal
Software:15063
No author found.
Related Items (only showing first 100 items - show all)
Unfolding partiality and disjunctions in stable model semantics ⋮ Backdoors to Normality for Disjunctive Logic Programs ⋮ Expressiveness of Logic Programs under the General Stable Model Semantics ⋮ Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming ⋮ Principled Software Development ⋮ Unnamed Item ⋮ Logic Programming and Nonmonotonic Reasoning ⋮ Logic Programming and Nonmonotonic Reasoning ⋮ Logic Programming and Nonmonotonic Reasoning ⋮ Logic Programming and Nonmonotonic Reasoning ⋮ Logic Programming and Nonmonotonic Reasoning ⋮ Logic Programming and Nonmonotonic Reasoning ⋮ Logic Programming and Nonmonotonic Reasoning ⋮ Logic Programming and Nonmonotonic Reasoning ⋮ Logic Programming and Nonmonotonic Reasoning ⋮ Logic Programming and Nonmonotonic Reasoning ⋮ Model enumeration in propositional circumscription via unsatisfiable core analysis ⋮ Inference and learning in probabilistic logic programs using weighted Boolean formulas ⋮ Knowledge compilation of logic programs using approximation fixpoint theory ⋮ ASPeRiX, a first-order forward chaining approach for answer set computing ⋮ Using Answer Set Programming for Commonsense Reasoning in the Winograd Schema Challenge ⋮ Modularity Aspects of Disjunctive Stable Models ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The nomore + + Approach to Answer Set Solving ⋮ The Relationship Between Reasoning About Privacy and Default Logics ⋮ Theory and Applications of Satisfiability Testing ⋮ Logic Programming ⋮ Logic Programming ⋮ Logic Programming ⋮ Logic Programming and Nonmonotonic Reasoning ⋮ Logic Programming and Nonmonotonic Reasoning ⋮ Logic Programming and Nonmonotonic Reasoning ⋮ Logic Programming and Nonmonotonic Reasoning ⋮ Optimization of bound disjunctive queries with constraints ⋮ Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs ⋮ Logic Programming ⋮ Logic Programming ⋮ Logic Programming ⋮ Debugging ASP Programs by Means of ASP ⋮ On the Complexity of Answer Set Programming with Aggregates ⋮ Conflict-Driven Answer Set Enumeration ⋮ Head-Elementary-Set-Free Logic Programs ⋮ A Normal Form for Linear Temporal Equilibrium Logic ⋮ Answer Set Programming ⋮ Explanatory Nonmonotonic Reasoning ⋮ Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets ⋮ Answering the “why” in answer set programming – A survey of explanation approaches ⋮ Tableau Calculi for Answer Set Programming ⋮ Justifications for Logic Programs Under Answer Set Semantics ⋮ TOAST: Applying Answer Set Programming to Superoptimisation ⋮ Experimenting with recursive queries in database and logic programming systems ⋮ Logic programs with monotone abstract constraint atoms ⋮ Omission-Based Abstraction for Answer Set Programs ⋮ Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs ⋮ Temporal Logic Modeling of Biological Systems ⋮ Abstraction for non-ground answer set programs ⋮ Weight Constraint Programs with Functions ⋮ Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Programs ⋮ Temporal phylogenetic networks and logic programming ⋮ Planning with preferences using logic programming ⋮ Modularity Aspects of Disjunctive Stable Models ⋮ Twelve Definitions of a Stable Model ⋮ Quo Vadis Answer Set Programming? ⋮ Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There ⋮ Engineering an Incremental ASP Solver ⋮ On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP ⋮ Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories ⋮ Abstract Answer Set Solvers ⋮ Logic Programming ⋮ On elementary loops of logic programs ⋮ Implementing Prioritized Merging with ASP ⋮ Look-back Techniques for ASP Programs with Aggregates ⋮ ASP Solving for Expanding Universes ⋮ The Intelligent Grounder of DLV ⋮ Characterising equilibrium logic and nested logic programs: Reductions and complexity, ⋮ Recursive rules with aggregation: a simple unified semantics ⋮ A generalization of the Lin-Zhao theorem ⋮ Equilibrium logic ⋮ Heuristics for planning with penalties and rewards formulated in logic and computed through circuits ⋮ Semantic forgetting in answer set programming ⋮ Outlier detection using default reasoning ⋮ A characterization of answer sets for logic programs ⋮ Unnamed Item ⋮ Answer set programming based on propositional satisfiability ⋮ Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction ⋮ SAT Modulo Graphs: Acyclicity ⋮ Improving the Normalization of Weight Rules in Answer Set Programs ⋮ Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? ⋮ A progression semantics for first-order logic programs ⋮ Tableau Calculi for Logic Programs under Answer Set Semantics ⋮ Integrating Inductive Definitions in SAT ⋮ Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs ⋮ On look-ahead heuristics in disjunctive logic programming ⋮ Enhancing DLV instantiator by backjumping techniques ⋮ Design and results of the Fifth Answer Set Programming Competition ⋮ Ordered completion for first-order logic programs on finite structures ⋮ Unnamed Item ⋮ Unnamed Item ⋮ What is answer set programming to propositional satisfiability
This page was built for software: ASSAT
