Complexity of computing with extended propositional logic programs (Q1924783): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Negation by default and unstratifiable logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of complexity results for non-monotonic logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3983043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Nonmonotonic Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3026978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Provability in Systems of Modal Propositional Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotonic Logic II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3939270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autoepistemic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic for default reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4282617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Semantics of Predicate Logic as a Programming Language / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01536401 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024932524 / rank
 
Normal rank

Latest revision as of 10:13, 30 July 2024

scientific article
Language Label Description Also known as
English
Complexity of computing with extended propositional logic programs
scientific article

    Statements

    Identifiers