Mixed integer programming methods for computing nonmonotonic deductive databases

DOI10.1145/195613.195637MaRDI QIDQ4327631zbMATH OpenOpenAlexFDO

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

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

declarative semanticsdeductive databaseslogic programmingnonmonotonic reasoningoperations research

Mathematics Subject Classification ID

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

Recommendations

• On computing logic programs
• Computing circumscriptive databases
• scientific article; zbMATH DE number 1368933
• scientific article; zbMATH DE number 4199653
• A non-ground realization of the stable and well-founded semantics

Cited in

(15)

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

This page was built for publication: Mixed integer programming methods for computing nonmonotonic deductive databases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4327631)