ASSAT

swMATH2524MaRDI QIDQ15063FDOQ15063

Author name not available (Why is that?)

Described by source

• ASSAT: computing answer sets of a logic program by SAT solvers

Cited In (only showing first 100 items - show all)

• Temporal phylogenetic networks and logic programming
• Dynamic and Static Symmetry Breaking in Answer Set Programming
• Logic Programming
• Look-back techniques for ASP programs with aggregates
• Model enumeration in propositional circumscription via unsatisfiable core analysis
• Automata and Answer Set Programming
• Metabolic Pathways as Temporal Logic Programs
• Temporal Logic Modeling of Biological Systems
• Answer Set Programming: A Declarative Approach to Solving Search Problems
• Logic Programming
• Answer Set Programming: A Primer
• A general first-order solution to the ramification problem with cycles
• Tableau Calculi for Logic Programs under Answer Set Semantics
• Expressiveness of Logic Programs under the General Stable Model Semantics
• Characterising equilibrium logic and nested logic programs: Reductions and complexity,
• On elementary loops of logic programs
• Experimenting with recursive queries in database and logic programming systems
• Towards Overcoming the Knowledge Acquisition Bottleneck in Answer Set Prolog Applications: Embracing Natural Language Inputs
• Towards automated integration of guess and check programs in answer set programming: a meta-interpreter and applications
• Rough set reasoning using answer set programs
• Experimenting with parallelism for the instantiation of ASP programs
• Theory and Applications of Satisfiability Testing
• Answering the “why” in answer set programming – A survey of explanation approaches
• Title not available (Why is that?)
• Guarded resolution for Answer Set Programming
• Logic Programming and Nonmonotonic Reasoning
• Disjunctive logic programs, answer sets, and the cut rule
• Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
• Improving the Normalization of Weight Rules in Answer Set Programs
• On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP
• Quo Vadis Answer Set Programming?
• Recursive rules with aggregation: a simple unified semantics
• SAT Modulo Graphs: Acyclicity
• Enhancing DLV instantiator by backjumping techniques
• Vicious circle principle, aggregates, and formation of sets in ASP based languages
• Design and results of the Fifth Answer Set Programming Competition
• Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
• The Relationship Between Reasoning About Privacy and Default Logics
• Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs
• SAT modulo discrete event simulation applied to railway design capacity analysis
• A progression semantics for first-order logic programs
• Bridging the Gap between Reinforcement Learning and Knowledge Representation: A Logical Off- and On-Policy Framework
• The Significance of Memory Costs in Answer Set Solver Implementation
• Loop Formulas for Splitable Temporal Logic Programs
• Extended ASP Tableaux and rule redundancy in normal logic programs
• Logic Programming and Nonmonotonic Reasoning
• Computing Stable Models via Reductions to Difference Logic
• A general framework for equivalences in Answer-Set Programming by countermodels in the logic of Here-and-There
• Logic Programming and Nonmonotonic Reasoning
• Efficient computation of answer sets via SAT modulo acyclicity and vertex elimination
• On Testing Answer-Set Programs
• What is answer set programming to propositional satisfiability
• Logic Programming and Nonmonotonic Reasoning
• A First Order Forward Chaining Approach for Answer Set Computing
• Justifications for Logic Programs Under Answer Set Semantics
• Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs
• Simple Random Logic Programs
• Answer Set Programming
• Graph-based construction of minimal models
• On look-ahead heuristics in disjunctive logic programming
• Monotonic Answer Set Programming
• A characterization of answer sets for logic programs
• Graphs and colorings for answer set programming
• Omission-Based Abstraction for Answer Set Programs
• ASP Solving for Expanding Universes
• Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Programs
• Title not available (Why is that?)
• Abstraction for non-ground answer set programs
• A Normal Form for Linear Temporal Equilibrium Logic
• Integrating Inductive Definitions in SAT
• Using Answer Set Programming for Commonsense Reasoning in the Winograd Schema Challenge
• Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Implementing Prioritized Merging with ASP
• Title not available (Why is that?)
• Title not available (Why is that?)
• Principled Software Development
• From (Quantified) Boolean Formulae to Answer Set Programming
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming
• Testing and debugging techniques for answer set solver development
• Answer Set Programming
• ASPeRiX, a first-order forward chaining approach for answer set computing
• Normalizing Cardinality Rules Using Merging and Sorting Constructions
• Logic programming with infinite sets
• The Intelligent Grounder of DLV
• Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses
• Semantics and complexity of recursive aggregates in answer set programming
• Outlier detection using default reasoning
• Title not available (Why is that?)
• My work with Victor Marek: a mathematician looks at answer set programming
• Twelve Definitions of a Stable Model
• Unfolding partiality and disjunctions in stable model semantics
• Catching the Ouroboros: On debugging non-ground answer-set programs
• Equilibrium logic
• Ordered completion for first-order logic programs on finite structures
• Title not available (Why is that?)
• Actions Over a Constructive Semantics for Description Logics
• Loop-separable programs and their first-order definability

This page was built for software: ASSAT