Mixed integer programming methods for computing nonmonotonic deductive databases

DOI10.1145/195613.195637zbMath0830.68039OpenAlexW2074154477MaRDI QIDQ4327631

Anil Nerode, Colin E. Bell, Raymond T. Ng, V. S. Subrahmanian

Publication date: 10 April 1995

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/195613.195637

zbMATH Keywords

nonmonotonic reasoninglogic programmingoperations researchdeductive databasesdeclarative semantics

Mathematics Subject Classification ID

Database theory (68P15) Logic programming (68N17)

Related Items

Computing definite logic programs by partial instantiation ⋮ Logic programming in tensor spaces ⋮ Parallel instantiation of ASP programs: techniques and experiments ⋮ Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation ⋮ Reasoning with minimal models: efficient algorithms and applications ⋮ Many-valued logic and mixed integer programming ⋮ Incremental methods for optimizing partial instantiation ⋮ A sequent calculus for skeptical Default Logic ⋮ An incremental algorithm for generating all minimal models ⋮ Computing minimal models by partial instantiation ⋮ Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories ⋮ Default reasoning from conditional knowledge bases: Complexity and tractable cases ⋮ Extending and implementing the stable model semantics