Integrating Inductive Definitions in SAT (Q3498482): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
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-75560-9_28 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1552768819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-Driven Answer Set Enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why are there so many loop formulas? / 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: Q4702577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability Checking for PC(ID) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating Inductive Definitions in SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3486858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The alternating fixpoint of logic programs with negation / 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: Logic Programming and Nonmonotonic Reasoning / rank
 
Normal rank

Latest revision as of 10:05, 28 June 2024

scientific article
Language Label Description Also known as
English
Integrating Inductive Definitions in SAT
scientific article

    Statements