Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

Modularity in smodels Programs: Label: en
Semantics for Possibilistic Disjunctive Programs: Label: en
Enhancing ASP Systems for Planning with Temporal Constraints: Label: en
General Default Logic: Label: en
Logic Programs with Abstract Constraints: Representaton, Disjunction and Complexities: Label: en
Conditional Planning with External Functions: Label: en
A Unified Semantics for Constraint Handling Rules in Transaction Logic: Label: en
A Characterization of Strong Equivalence for Logic Programs with Variables: Label: en
Modularity Aspects of Disjunctive Stable Models: Label: en
A Deductive System for PC(ID): Label: en
Head-Elementary-Set-Free Logic Programs: Label: en
Conflict-Driven Answer Set Enumeration: Label: en
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains: Label: en
Experimenting with Look-Back Heuristics for Hard ASP Programs: Label: en
On the Complexity of Answer Set Programming with Aggregates: Label: en
Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions: Label: en
A Preference-Based Framework for Updating Logic Programs: Label: en
Complexity of Default Logic on Generalized Conjunctive Queries: Label: en
A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation: Label: en
Debugging ASP Programs by Means of ASP: Label: en
cr-models: An Inference Engine for CR-Prolog: Label: en
Computing the acceptability semantics: Label: en
Trans-epistemic semantics for logic programs: Label: en
Nonmonotonicity and answer set inference: Label: en
Stable classes and operator pairs for disjunctive programs: Label: en
Embedding circumscriptive theories in general disjunctive programs: Label: en
An abductive framework for extended logic programming: Label: en
Nonmonotonic inheritance, argumentation and logic programming: Label: en
A transformation of propositional Prolog programs into classical logic: Label: en
Incremental methods for optimizing partial instantiation: Label: en
Reasoning with stratified default theories: Label: en
Skeptical rational extensions: Label: en
Default consequence relations as a logical framework for logic programs: Label: en
On the extension of logic programming with negation through uniform proofs: Label: en
Situation calculus specifications for event calculus logic programs: Label: en
Hypothetical updates, priority and inconsistency in a logic programming language: Label: en
Revision by communication: Label: en
A sphere world semantics for default reasoning: Label: en
Update by means of inference rules: Label: en
Annotated revision specification programs: Label: en
Loop checking and the well-founded semantics: Label: en
Computing the well-founded semantics faster: Label: en
Game characterizations of logic program properties: Label: en
Characterizations of the stable semantics by partial evaluation: Label: en
Update rules in datalog programs: Label: en
An operator for composing deductive data bases with theories of constraints: Label: en
On logical constraints in logic programming: Label: en
Abduction over 3-valued extended logic programs: Label: en
A terminological interpretation of (abductive) logic programming: Label: en
Complexity results for abductive logic programming: Label: en