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.

Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence: Label: en
Quantified Equilibrium Logic and Foundations for Answer Set Programs: Label: en
Cadmium: An Implementation of ACD Term Rewriting: Label: en
Transactions in Constraint Handling Rules: Label: en
Termination Analysis of CHR Revisited: Label: en
Optimization of CHR Propagation Rules: Label: en
Prolog Based Description Logic Reasoning: Label: en
Verification from Declarative Specifications Using Logic Programming: Label: en
Composing Normal Programs with Function Symbols: Label: en
Computable Functions in ASP: Theory and Implementation: Label: en
Partial Functions and Equality in Answer Set Programming: Label: en
Abstract Answer Set Solvers: Label: en
Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories: Label: en
Lparse Programs Revisited: Semantics and Representation of Aggregates: Label: en
Dynamic Analysis of Bounds Versus Domain Propagation: Label: en
Termination of Narrowing Using Dependency Pairs: Label: en
Negative Ternary Set-Sharing: Label: en
A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs: Label: en
Declarative Semantics for Active Integrity Constraints: Label: en
Towards Ludics Programming: Interactive Proof Search: Label: en
α lean TA P: A Declarative Theorem Prover for First-Order Classical Logic: Label: en
On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP: Label: en
Concurrent and Local Evaluation of Normal Programs: Label: en
Engineering an Incremental ASP Solver: Label: en
On the Efficient Execution of ProbLog Programs: Label: en
Automatic Composition of Melodic and Harmonic Music by Answer Set Programming: Label: en
Detecting Inconsistencies in Large Biological Networks with Answer Set Programming: Label: en
Dynamic Programming Algorithms as Products of Weighted Logic Programs: Label: en
Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There: Label: en
Answer Set Programming without Unstratified Negation: Label: en
Quo Vadis Answer Set Programming?: Label: en
SMS and ASP: Hype or TST?: Label: en
Building a Knowledge Base System for an Integration of Logic Programming and Classical Logic: Label: en
Sixty Years of Stable Models: Label: en
Twelve Definitions of a Stable Model: Label: en
Authorization and Obligation Policies in Dynamic Systems: Label: en
Separation Logic Tutorial: Label: en
A Soft Approach to Multi-objective Optimization: Label: en
Turing-Complete Subclasses of CHR: Label: en
Removing Redundancy from Answer Set Programs: Label: en
Towards Typed Prolog: Label: en
TopLog: ILP Using a Logic Program Declarative Bias: Label: en
Stochastic Behavior and Explicit Discrete Time in Concurrent Constraint Programming: Label: en
Non-determinism and Probabilities in Timed Concurrent Constraint Programming: Label: en
Safe Formulas in the General Theory of Stable Models (Preliminary Report): Label: en
Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics: Label: en
A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism: Label: en
Constraint-Level Advice for Shaving: Label: en
Two WAM Implementations of Action Rules: Label: en
Efficient Algorithms for Functional Constraints: Label: en