Pages that link to "Item:Q1761291"

The following pages link to Conflict-driven answer set solving: from theory to practice (Q1761291):

Displaying 50 items.

• On abstract modular inference systems and solvers (Q286083) (← links)
• The configurable SAT solver challenge (CSSC) (Q502389) (← links)
• Learning discrete decomposable graphical models via constraint optimization (Q517387) (← links)
• Conflict resolution: a first-order resolution calculus with decision literals and conflict-driven clause learning (Q682374) (← links)
• Design and results of the Fifth Answer Set Programming Competition (Q899444) (← links)
• Extended RDF: computability and complexity issues (Q905991) (← links)
• Best-effort inductive logic programming via fine-grained cost-based hypothesis generation. The Inspire system at the inductive logic programming competition (Q1621888) (← links)
• A progression semantics for first-order logic programs (Q1680677) (← links)
• On the complexity of input/output logic (Q1688711) (← links)
• What is answer set programming to propositional satisfiability (Q1699519) (← links)
• Efficient benchmarking of algorithm configurators via model-based surrogates (Q1707462) (← links)
• A network model for routing-fault-free wavelength selection in WRONoCs design (Q1742244) (← links)
• An investigation of parametrized difference revision operators (Q2029703) (← links)
• Revising event calculus theories to recover from unexpected observations (Q2029718) (← links)
• Fixed point semantics for stream reasoning (Q2046012) (← links)
• DualGrounder: lazy instantiation via clingo multi-shot framework (Q2055820) (← links)
• A multi-shot ASP encoding for the aircraft routing and maintenance planning problem (Q2055823) (← links)
• Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search (Q2074664) (← links)
• Graph-based construction of minimal models (Q2093381) (← links)
• Assessing progress in SAT solvers through the Lens of incremental SAT (Q2118309) (← links)
• Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving (Q2124467) (← links)
• Inductive logic programming at 30 (Q2127222) (← links)
• Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version (Q2133436) (← links)
• Learning Boolean controls in regulated metabolic networks: a case-study (Q2142113) (← links)
• Meta-interpretive learning: application to grammatical inference (Q2251448) (← links)
• A general approach to reasoning with probabilities (Q2283285) (← links)
• Knowledge representation analysis of graph mining (Q2317967) (← links)
• A parallel memory-efficient epistemic logic program solver: harder, better, faster (Q2317970) (← links)
• A multiparametric view on answer set programming (Q2317973) (← links)
• Vicious circle principle, aggregates, and formation of sets in ASP based languages (Q2321320) (← links)
• Forgetting auxiliary atoms in forks (Q2321342) (← links)
• The dramatic true story of the frame default (Q2341259) (← links)
• Backdoors to tractable answer set programming (Q2341833) (← links)
• Supportedly stable answer sets for logic programs with generalized atoms (Q2360180) (← links)
• Lpopt: a rule optimization tool for answer set programming (Q2409731) (← links)
• Many-valued dynamic object-oriented inheritance and approximations (Q2670890) (← links)
• Enumeration of minimal models and MUSes in WASP (Q2694547) (← links)
• IASCAR: incremental answer set counting by anytime refinement (Q2694570) (← links)
• A machine learning system to improve the performance of ASP solving based on encoding selection (Q2694597) (← links)
• QMaxSATpb: a certified MaxSAT solver (Q2694600) (← links)
• SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers (Q2818043) (← links)
• Exploiting Unfounded Sets for HEX-Program Evaluation (Q2915067) (← links)
• Improving the Normalization of Weight Rules in Answer Set Programs (Q2938492) (← links)
• Inductive Learning of Answer Set Programs (Q2938503) (← links)
• Advances in WASP (Q3449189) (← links)
• Answer Set Programming Modulo Acyclicity (Q3449199) (← links)
• A Formal Theory of Justifications (Q3449209) (← links)
• Progress in clasp Series 3 (Q3449220) (← links)
• Logic Programming with Graded Modality (Q3449234) (← links)
• The Design of the Sixth Answer Set Programming Competition (Q3449235) (← links)