Pages that link to "Item:Q1924728"
From MaRDI portal
The following pages link to Static semantics for normal and disjunctive logic programs (Q1924728):
Displaying 21 items.
- Semantics of structured normal logic programs (Q444364) (← links)
- Enhancing disjunctive logic programming systems by SAT checkers (Q814529) (← links)
- Semantics of Horn and disjunctive logic programs (Q1177928) (← links)
- Autoepistemic logic of knowledge and beliefs (Q1389599) (← links)
- A logic programming system for nonmonotonic reasoning (Q1891266) (← links)
- Well-founded and stationary models of logic programs (Q1924748) (← links)
- Propositional semantics for disjunctive logic programs (Q1924819) (← links)
- Disjunctive logic programs, answer sets, and the cut rule (Q2085572) (← links)
- Determining inference semantics for disjunctive logic programs (Q2289011) (← links)
- Well-Founded and Partial Stable Semantics Logical Aspects (Q3392936) (← links)
- Stable semantics for disjunctive programs (Q3983045) (← links)
- The infinite-valued semantics: overview, recent results and future directions (Q4583316) (← links)
- A tableau calculus for minimal model reasoning (Q4645243) (← links)
- Belief, provability, and logic programs (Q4835514) (← links)
- Characterizations of the stable semantics by partial evaluation (Q5101443) (← links)
- Strong and explicit negation in non-monotonic reasoning and logic programming (Q5236430) (← links)
- Characterizing D-WFS: Confluence and iterated GCWA (Q5236439) (← links)
- On the equivalence of the static and disjunctive well-founded semantics and its computation (Q5941206) (← links)
- Closed world assumption for disjunctive reasoning (Q5959358) (← links)
- Prolegomena to logic programming for non-monotonic reasoning (Q6623791) (← links)
- On logics and semantics for general logic programs (Q6623792) (← links)
