scientific article; zbMATH DE number 4199656

Recommendations

scientific article; zbMATH DE number 4199653
scientific article; zbMATH DE number 4147465
Publication:3484349
On the declarative and procedural semantics of logic programs
scientific article; zbMATH DE number 545140
An alternative approach to the semantics of disjunctive logic programs and deductive databases
Declarative Logic Programming: Theory, Systems, and Applications
scientific article; zbMATH DE number 10085
Semantics and expressive power of nondeterministic constructs in deductive databases

Cited in

(only showing first 100 items - show all)

Computing only minimal answers in disjunctive deductive databases
Inferring negative information from disjunctive databases
On the relationship between circumscription and negation as failure
An algorithm to compute circumscription
Minimalism, justification and non-monotonicity in deductive databases
Reasoning with minimal models: efficient algorithms and applications
Circumscribing DATALOG: expressive power and complexity
General logical databases and programs: Default logic semantics and stratification
Acyclic logic programs and the completeness of SLDNF-resolution
Unfold/fold transformation of stratified programs
Three-valued nonmonotonic formalisms and semantics of logic programs
A simple fixed point characterization of three-valued stable model semantics
Testing logic programs for local stratification
The relationship between stable, supported, default and autoepistemic semantics for general logic programs
On the relations between stable and well-founded semantics of logic programs
Transforming normal logic programs to constraint logic programs
Verifying local stratifiability of logic programs and databases
Relating minimal models and pre-requisite-free normal defaults
Graph properties for normal logic programs
A transformation system for deductive database modules with perfect model semantics
Lexicographic priorities in default logic
Logic programs, well-orderings, and forward chaining
A context for belief revision: forward chaining-normal nonmonotonic rule systems
Logic program semantics and circumscription of autoepistemic theories
Stratified least fixpoint logic
Bottom-up evaluation of datalog with negation
A three-valued semantics for deductive databases and logic programs
Formalizing incomplete knowledge in incomplete databases
An overview of transaction logic
An alternative approach to the semantics of disjunctive logic programs and deductive databases
Querying disjunctive databases through nonmonotonic logics
Generalized disjunctive well-founded semantics for logic programs.
Formalizing a logic for logic programming
On stratified disjunctive programs
Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
Disjunctive logic and semantics of disjunctive logic programs
Autoepistemic logic of knowledge and beliefs
Abduction from logic programs: Semantics and complexity
A unifying view for logic programming with non-monotonic reasoning
An abstract, argumentation-theoretic approach to default reasoning
Stratified resolution
Generalized metrics and uniquely determined logic programs.
Prioritized logic programming and its application to commonsense reasoning
Logic programming and knowledge representation---The A-Prolog perspective
Fixpoint semantics for logic programming a survey
Safe inductions and their applications in knowledge representation
A comparison of Statecharts step semantics
Induction = I-axiomatization + first-order consistency.
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
The meaning of negative premises in transition system specifications. II
The expressiveness of locally stratified programs
Well-founded and stationary models of logic programs
Modular specifications with supernormal defaults
Logic programming and reasoning with incomplete information
Rooted branching bisimulation as a congruence
The Fusemate logic programming system
Possible models computation and revision -- a practical approach
Efficient and flexible access control via Jones-optimal logic program specialisation
Database querying under changing preferences
Complexity results for answer set programming with bounded predicate arities and implications
Semi-equilibrium models for paracoherent answer set programs
Temporal stratification tests for linear and branching-time deductive databases
\texttt{xASP}: an explanation generation system for answer set programming
Constructing interpretations of deductive databases using reduction and dynamic stratification
scientific article; zbMATH DE number 1696847 (Why is no real title available?)
To Vladimir Lifschitz on His 65th Birthday
Modular paracoherent answer sets
A necessary condition for constructive negation in constraint logic programming
COMPUTING THE WELL-FOUNDED MODEL OF DEDUCTIVE DATABASES
scientific article; zbMATH DE number 4199653 (Why is no real title available?)
scientific article; zbMATH DE number 4205970 (Why is no real title available?)
scientific article; zbMATH DE number 4155872 (Why is no real title available?)
Answer Set Programming: A Primer
scientific article; zbMATH DE number 4112085 (Why is no real title available?)
scientific article; zbMATH DE number 49786 (Why is no real title available?)
scientific article; zbMATH DE number 52489 (Why is no real title available?)
scientific article; zbMATH DE number 4125378 (Why is no real title available?)
scientific article; zbMATH DE number 545140 (Why is no real title available?)
scientific article; zbMATH DE number 1735824 (Why is no real title available?)
IsaLog¬: a deductive language with negation for complex-object databases with hierarchies
Semantics of structured normal logic programs
On cyclic covers and perfect models
Declarative Logic Programming: Theory, Systems, and Applications
Some properties of system descriptions of \(\mathcal{AL}_d\)
On the relation between SPARQL1.1 and Answer Set Programming
Modeling the suppression task under weak completion and well-founded semantics
The intricacies of three-valued extensional semantics for higher-order logic programs
Knowledge compilation of logic programs using approximation fixpoint theory
A model building framework for answer set programming with external computations
scientific article; zbMATH DE number 2085287 (Why is no real title available?)
scientific article; zbMATH DE number 870410 (Why is no real title available?)
On the coincidence of semantics for uniquely determined programs
Datalog: Bag Semantics via Set Semantics
Fixpoint techniques for non-monotone maps
On the strong completion of logic programs
Eliminating negation from normal logic programs
Partial order programming (revisited)
Two simple characterizations of well-founded semantics
Characterizations of the stable semantics by partial evaluation
On the extension of logic programming with negation through uniform proofs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3348437)