scientific article
From MaRDI portal
Publication:3348437
zbMath0726.68067MaRDI QIDQ3348437
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
A context for belief revision: forward chaining-normal nonmonotonic rule systems ⋮ Logic program semantics and circumscription of autoepistemic theories ⋮ Stratified least fixpoint logic ⋮ The meaning of negative premises in transition system specifications. II ⋮ Bottom-up evaluation of datalog with negation ⋮ A three-valued semantics for deductive databases and logic programs ⋮ Formalizing incomplete knowledge in incomplete databases ⋮ A necessary condition for constructive negation in constraint logic programming ⋮ An overview of transaction logic ⋮ To Vladimir Lifschitz on His 65th Birthday ⋮ 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 ⋮ Database querying under changing preferences ⋮ Safe inductions and their applications in knowledge representation ⋮ Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation ⋮ Disjunctive logic and semantics of disjunctive logic programs ⋮ 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 ⋮ Modular Paracoherent Answer Sets ⋮ Reasoning with minimal models: efficient algorithms and applications ⋮ Circumscribing DATALOG: expressive power and complexity ⋮ 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 ⋮ Some properties of system descriptions of ⋮ On the relation between SPARQL1.1 and Answer Set Programming ⋮ Modeling the suppression task under weak completion and well-founded semantics ⋮ Fixpoint techniques for non-monotone maps ⋮ On the strong completion of logic programs ⋮ Eliminating negation from normal logic programs ⋮ Partial order programming (Revisited) ⋮ Autoepistemic logic of knowledge and beliefs ⋮ Two simple characterizations of well-founded semantics ⋮ Abduction from logic programs: Semantics and complexity ⋮ A unifying view for logic programming with non-monotonic reasoning ⋮ Characterizations of the stable semantics by partial evaluation ⋮ On the extension of logic programming with negation through uniform proofs ⋮ Embedding circumscriptive theories in general disjunctive programs ⋮ 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 ⋮ An abstract, argumentation-theoretic approach to default reasoning ⋮ Complexity results for answer set programming with bounded predicate arities and implications ⋮ Stratified resolution ⋮ \texttt{xASP}: an explanation generation system for answer set programming ⋮ Semantics of structured normal logic programs ⋮ Generalized metrics and uniquely determined logic programs. ⋮ 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 ⋮ A functorial framework for constraint normal logic programming ⋮ Rooted branching bisimulation as a congruence ⋮ Three-valued nonmonotonic formalisms and semantics of logic programs ⋮ A simple fixed point characterization of three-valued stable model semantics ⋮ Contributions to the stable model semantics of logic programs with negation ⋮ Bottom-up evaluation and query optimization of well-founded models ⋮ Tie-breaking semantics and structural totality ⋮ Monotonic aggregation in deductive databases ⋮ Locally stratified Boolean grammars ⋮ On the autoepistemic reconstruction of logic programming ⋮ A theory of nonmonotonic inheritance based on annotated logic ⋮ Transition system specifications with negative premises ⋮ Testing logic programs for local stratification ⋮ The relationship between stable, supported, default and autoepistemic semantics for general logic programs ⋮ A logic for programming with complex objects ⋮ The alternating fixpoint of logic programs with negation ⋮ On the relations between stable and well-founded semantics of logic programs ⋮ Transforming normal logic programs to constraint logic programs ⋮ A logic for reasoning with inconsistency ⋮ 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 ⋮ On the Coincidence of Semantics for Uniquely Determined Programs ⋮ Semantics and complexity of recursive aggregates in answer set programming ⋮ Efficient and flexible access control via Jones-optimal logic program specialisation ⋮ Conditional entailment: bridging two approaches to default reasoning. ⋮ The Fusemate logic programming system ⋮ Programming in three-valued logic ⋮ The semantics of incomplete databases as an expression of preferences ⋮ Answer Set Programming: A Primer ⋮ Lexicographic priorities in default logic ⋮ Computing only minimal answers in disjunctive deductive databases ⋮ Temporal stratification tests for linear and branching-time deductive databases ⋮ Logic programs, well-orderings, and forward chaining ⋮ Prioritized logic programming and its application to commonsense reasoning ⋮ Possible models computation and revision -- a practical approach ⋮ 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 expressive power of stratified logic programs ⋮ Logic programming and knowledge representation---The A-Prolog perspective ⋮ Fixpoint semantics for logic programming a survey ⋮ Semi-equilibrium models for paracoherent answer set programs
This page was built for publication:
