On look-ahead heuristics in disjunctive logic programming (Q2426102): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Chaff / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BerkMin / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Datalog / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10472-008-9087-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2165291970 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knowledge Representation, Reasoning and Declarative Problem Solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic programming and knowledge representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional semantics for disjunctive logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5480653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2734932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational cost of disjunctive logic programming: Propositional case / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of logic-based abduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimenting with Look-Back Heuristics for Hard ASP Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4800163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming and Nonmonotonic Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-Driven Answer Set Enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3983043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: BerkMin: A fast and robust SAT-solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching rules for satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: ASSAT: computing answer sets of a logic program by SAT solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3939270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3983045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending and implementing the stable model semantics / rank
 
Normal rank

Latest revision as of 21:51, 27 June 2024

scientific article
Language Label Description Also known as
English
On look-ahead heuristics in disjunctive logic programming
scientific article

    Statements

    On look-ahead heuristics in disjunctive logic programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 April 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    Artificial intelligence
    0 references
    Logic programming
    0 references
    Nonmonotonic reasoning
    0 references
    Answer set programming
    0 references
    Heuristics
    0 references
    Stable models
    0 references
    Efficient evaluation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references