Abstract Answer Set Solvers (Q5504668): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-89982-2_35 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1523419405 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving SAT and SAT Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Answer set programming based on propositional satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming and Nonmonotonic Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: The well-founded semantics for general logic programs / 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: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tableau Calculi for Answer Set Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation / rank
 
Normal rank

Latest revision as of 23:31, 28 June 2024