The following pages link to Why not negation by fixpoint? (Q1176286):
Displaying 32 items.
- Tie-breaking semantics and structural totality (Q676419) (← links)
- A logic for programming with complex objects (Q686642) (← links)
- The alternating fixpoint of logic programs with negation (Q686646) (← links)
- Negation in rule-based database languages: A survey (Q753476) (← links)
- Negation by default and unstratifiable logic programs (Q753501) (← links)
- Fundamental properties of deterministic and nondeterministic extensions of Datalog (Q756410) (← links)
- Circumscribing DATALOG: expressive power and complexity (Q1127538) (← links)
- Datalog extensions for database queries and updates (Q1176285) (← links)
- Expressive power and complexity of partial models for disjunctive deductive databases (Q1274974) (← links)
- Succinctness as a source of complexity in logical formalisms (Q1302307) (← links)
- Backchain iteration: Towards a practical inference method that is simple enough to be proved terminating, sound, and complete (Q1311394) (← links)
- Querying datalog programs with temporal logic (Q1323325) (← links)
- The complexity of propositional closed world reasoning and circumscription (Q1329160) (← links)
- Bottom-up evaluation of datalog with negation (Q1333369) (← links)
- Multiple total stable models are definitely needed to solve unique solution problems (Q1349967) (← links)
- Formalizing a logic for logic programming (Q1354044) (← links)
- The expressive powers of stable models for bound and unbound DATALOG queries (Q1362337) (← links)
- Queries and computation on the web (Q1575133) (← links)
- Games and total Datalog\(^{\lnot}\) queries (Q1575136) (← links)
- Answer set programming in intuitionistic logic (Q1688962) (← links)
- On the complexity of data disjunctions. (Q1853503) (← links)
- Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\). (Q1854304) (← links)
- Functional queries in datalog (Q1862647) (← links)
- Complexity and undecidability results for logic programming (Q1924779) (← links)
- Inductive definitions over finite structures (Q2639057) (← links)
- Logical foundations and complexity of 4QL, a query language with unrestricted negation (Q2901212) (← links)
- atalog: A logic language for expressing search and optimization problems (Q3550912) (← links)
- The expressive power of unique total stable model semantics (Q4572012) (← links)
- An analysis of the Core-ML language: Expressive power and type reconstruction (Q4632418) (← links)
- About boundedness for some datalog and DATALOGneg programs (Q5096840) (← links)
- CAN w < -1 BE EXORCIZED? (Q5702841) (← links)
- The expressive power of ``possible-is-certain'' semantics (extended abstract) (Q6560352) (← links)
