Computing circumscriptive databases
From MaRDI portal
Publication:1346715
DOI10.1006/inco.1995.1005zbMath0829.68042OpenAlexW1537170873MaRDI QIDQ1346715
V. S. Subrahmanian, Raymond T. Ng
Publication date: 10 April 1995
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1995.1005
Related Items (9)
Computing definite logic programs by partial instantiation ⋮ Reasoning under minimal upper bounds in propositional logic ⋮ On compact representations of propositional circumscription ⋮ Is intractability of nonmonotonic reasoning a real drawback? ⋮ Reducing belief revision to circumscription (and vice versa) ⋮ Computing minimal models by partial instantiation ⋮ A tableau calculus for minimal model reasoning ⋮ Preprocessing of intractable problems ⋮ Inference flexibility in Horn clause knowledge bases and the simplex method
This page was built for publication: Computing circumscriptive databases
