The following pages link to (Q3348437):
Displaying 50 items.
- Semi-equilibrium models for paracoherent answer set programs (Q253992) (← links)
- A necessary condition for constructive negation in constraint logic programming (Q294756) (← links)
- Semantics of structured normal logic programs (Q444364) (← links)
- Semantics and complexity of recursive aggregates in answer set programming (Q543600) (← links)
- Contributions to the stable model semantics of logic programs with negation (Q672705) (← links)
- Bottom-up evaluation and query optimization of well-founded models (Q673130) (← links)
- Tie-breaking semantics and structural totality (Q676419) (← links)
- Monotonic aggregation in deductive databases (Q676422) (← links)
- On the autoepistemic reconstruction of logic programming (Q685123) (← links)
- A theory of nonmonotonic inheritance based on annotated logic (Q685338) (← links)
- Transition system specifications with negative premises (Q685387) (← links)
- A logic for programming with complex objects (Q686642) (← links)
- The alternating fixpoint of logic programs with negation (Q686646) (← links)
- A logic for reasoning with inconsistency (Q688558) (← links)
- Programming in three-valued logic (Q753474) (← links)
- The semantics of incomplete databases as an expression of preferences (Q753482) (← links)
- The expressive power of stratified logic programs (Q803773) (← links)
- A functorial framework for constraint normal logic programming (Q934677) (← links)
- Locally stratified Boolean grammars (Q948094) (← links)
- Conditional entailment: bridging two approaches to default reasoning. (Q989161) (← links)
- Computing only minimal answers in disjunctive deductive databases (Q1040782) (← links)
- Inferring negative information from disjunctive databases (Q1114440) (← links)
- On the relationship between circumscription and negation as failure (Q1115207) (← links)
- An algorithm to compute circumscription (Q1115208) (← links)
- Minimalism, justification and non-monotonicity in deductive databases (Q1123011) (← links)
- Reasoning with minimal models: efficient algorithms and applications (Q1127346) (← links)
- Circumscribing DATALOG: expressive power and complexity (Q1127538) (← links)
- General logical databases and programs: Default logic semantics and stratification (Q1173955) (← links)
- Acyclic logic programs and the completeness of SLDNF-resolution (Q1177925) (← links)
- Unfold/fold transformation of stratified programs (Q1177929) (← links)
- Three-valued nonmonotonic formalisms and semantics of logic programs (Q1182168) (← links)
- A simple fixed point characterization of three-valued stable model semantics (Q1183439) (← links)
- Testing logic programs for local stratification (Q1199536) (← links)
- The relationship between stable, supported, default and autoepistemic semantics for general logic programs (Q1199545) (← links)
- On the relations between stable and well-founded semantics of logic programs (Q1200977) (← links)
- Transforming normal logic programs to constraint logic programs (Q1200979) (← links)
- Verifying local stratifiability of logic programs and databases (Q1205177) (← links)
- Relating minimal models and pre-requisite-free normal defaults (Q1205716) (← links)
- Graph properties for normal logic programs (Q1208418) (← links)
- A transformation system for deductive database modules with perfect model semantics (Q1208734) (← links)
- Lexicographic priorities in default logic (Q1277698) (← links)
- Logic programs, well-orderings, and forward chaining (Q1295428) (← links)
- A context for belief revision: forward chaining-normal nonmonotonic rule systems (Q1326782) (← links)
- Logic program semantics and circumscription of autoepistemic theories (Q1327306) (← links)
- Stratified least fixpoint logic (Q1331926) (← links)
- Bottom-up evaluation of datalog with negation (Q1333369) (← links)
- A three-valued semantics for deductive databases and logic programs (Q1337468) (← links)
- Formalizing incomplete knowledge in incomplete databases (Q1337644) (← links)
- An overview of transaction logic (Q1341707) (← links)
- An alternative approach to the semantics of disjunctive logic programs and deductive databases (Q1344892) (← links)
