Why not negation by fixpoint?
From MaRDI portal
Recommendations
Cites work
- A lattice-theoretical fixpoint theorem and its applications
- A note on succinct representations of graphs
- Contributions to the Theory of Logic Programming
- Elementary induction on abstract structures
- Fixed-point extensions of first-order logic
- Horn clause queries and generalizations
- scientific article; zbMATH DE number 4199654 (Why is no real title available?)
- scientific article; zbMATH DE number 3930351 (Why is no real title available?)
- scientific article; zbMATH DE number 3988706 (Why is no real title available?)
- scientific article; zbMATH DE number 4035805 (Why is no real title available?)
- scientific article; zbMATH DE number 3474957 (Why is no real title available?)
- On the unique satisfiability problem
- Reducibility among combinatorial problems
- Relational queries computable in polynomial time
- Some simplified NP-complete graph problems
- Structure and complexity of relational queries
- The complexity of facets (and some facets of complexity)
- The expressive power of stratified logic programs
- The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses
Cited in
(37)- Circumscribing DATALOG: expressive power and complexity
- Datalog extensions for database queries and updates
- Expressive power and complexity of partial models for disjunctive deductive databases
- Succinctness as a source of complexity in logical formalisms
- Backchain iteration: Towards a practical inference method that is simple enough to be proved terminating, sound, and complete
- Querying datalog programs with temporal logic
- The complexity of propositional closed world reasoning and circumscription
- Bottom-up evaluation of datalog with negation
- Multiple total stable models are definitely needed to solve unique solution problems
- Formalizing a logic for logic programming
- The expressive powers of stable models for bound and unbound DATALOG queries
- Queries and computation on the web
- Games and total Datalog\(^{\lnot}\) queries
- Answer set programming in intuitionistic logic
- On the complexity of data disjunctions.
- Complexity and expressive power of deterministic semantics for DATALOG^ .
- Functional queries in datalog
- Complexity and undecidability results for logic programming
- Inductive definitions over finite structures
- Logical foundations and complexity of 4QL, a query language with unrestricted negation
- scientific article; zbMATH DE number 4180775 (Why is no real title available?)
- \(\mathcal {NPD}\)atalog: A logic language for expressing \(\mathcal {NP}\) search and optimization problems
- scientific article; zbMATH DE number 1059307 (Why is no real title available?)
- The expressive power of unique total stable model semantics
- An analysis of the Core-ML language: Expressive power and type reconstruction
- Similarity-based relations in Datalog programs
- About boundedness for some DATALOG and DATALOG\textsuperscript{neg} programs
- scientific article; zbMATH DE number 2218053 (Why is no real title available?)
- CAN w < -1 BE EXORCIZED?
- The expressive power of ``possible-is-certain semantics (extended abstract)
- Tie-breaking semantics and structural totality
- A logic for programming with complex objects
- The alternating fixpoint of logic programs with negation
- Convergence of datalog over (pre-) semirings
- Negation in rule-based database languages: A survey
- Negation by default and unstratifiable logic programs
- Fundamental properties of deterministic and nondeterministic extensions of Datalog
This page was built for publication: Why not negation by fixpoint?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1176286)
