scientific article
From MaRDI portal
Publication:3983043
zbMath0735.68012MaRDI QIDQ3983043
Vladimir Lifschitz, Michael Gelfond
Publication date: 26 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems, A Neuro-Symbolic ASP Pipeline for Visual Question Answering, The Design of the Sixth Answer Set Programming Competition, The complexity class θp2: Recent results and applications in AI and modal logic, Default Negation as Explicit Negation plus Update, Cautious reasoning in ASP via minimal models and unsatisfiable cores, Constraint Answer Set Programming without Grounding, An ASP Methodology for Understanding Narratives about Stereotypical Activities, Exploiting Answer Set Programming with External Sources for Meta-Interpretive Learning, Translating LPOD and CR-Prolog2into standard answer set programs, Update rules in datalog programs, RASP and ASP as a fragment of linear logic, Model-based recasting in answer-set programming, Some properties of system descriptions of, On deductive bases for paraconsistent answer set semantics, On the relation between SPARQL1.1 and Answer Set Programming, The Semantics of Consistency and Trust in Peer Data Exchange Systems, $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols, A terminological interpretation of (abductive) logic programming, Characterizations of the stable semantics by partial evaluation, Loop checking and the well-founded semantics, On the extension of logic programming with negation through uniform proofs, Embedding circumscriptive theories in general disjunctive programs, Stable classes and operator pairs for disjunctive programs, Nonmonotonicity and answer set inference, Clingo goes linear constraints over reals and integers, Hybrid conditional planning using answer set programming, Generating explanations for biomedical queries, Characterizing and extending answer set semantics using possibility theory, Improved answer-set programming encodings for abstract argumentation, Dual-normal logic programs – the forgotten class, Rewriting recursive aggregates in answer set programming: back to monotonicity, Complexity and compilation of GZ-aggregates in answer set programming, Fuzzy answer set computation via satisfiability modulo theories, Taming primary key violations to query large inconsistent data via ASP, Checking termination of bottom-up evaluation of logic programs with function symbols, Justifying answer sets using argumentation, Modular action language, Using linear constraints for logic program termination analysis, A model building framework for answer set programming with external computations, Disjunctive answer set solvers via templates, Anytime answer set optimization via unsatisfiable core shrinking, Stable-unstable semantics: Beyond NP with normal logic programs, Justifications for programs with disjunctive and causal-choice rules, Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper), <scp>Core</scp>ALM<scp>lib</scp>: An library translated from the <scp>Component Library</scp>, The<scp>dlvhex</scp>system for knowledge representation: recent advances (system description), Consistency and trust in peer data exchange systems, ASPeRiX, a first-order forward chaining approach for answer set computing, CASP solutions for planning in hybrid domains, Enhancing Magic Sets with an Application to Ontological Reasoning, Paracoherent Answer Set Semantics meets Argumentation Frameworks, Beyond NP: Quantifying over Answer Sets, Abstract Solvers for Computing Cautious Consequences of ASP programs, Better Paracoherent Answer Sets with Less Resources, About Epistemic Negation and World Views in Epistemic Logic Programs, On Uniform Equivalence of Epistemic Logic Programs, Partial Compilation of ASP Programs, Revisiting Explicit Negation in Answer Set Programming, Incremental Answer Set Programming with Overgrounding, A Syntactic Operator for Forgetting that Satisfies Strong Persistence, Precomputing Datalog Evaluation Plans in Large-Scale Scenarios, An application of answer set programming to the field of second language acquisition, Stepwise debugging of answer-set programs, Temporal Equilibrium Logic: A First Approach, A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption, A Logical Approach to Qualitative and Quantitative Reasoning, An Algorithm for Computing Semi-stable Semantics, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Implementing Prioritized Circumscription by Computing Disjunctive Stable Models, On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability, Foundations of Onto-Relational Learning, eclingo : A Solver for Epistemic Logic Programs, Modular Nonmonotonic Logic Programming Revisited, Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs, Inductive Negotiation in Answer Set Programming, Inlining External Sources in Answer Set Programs, Optimizing Answer Set Computation via Heuristic-Based Decomposition, Efficiently Coupling the I-DLV Grounder with ASP Solvers, The External Interface for Extending WASP, ASP-Core-2 Input Language Format, Solving Advanced Argumentation Problems with Answer Set Programming, selp: A Single-Shot Epistemic Logic Program Solver, A Logic-Based Framework Leveraging Neural Networks for Studying the Evolution of Neurological Disorders, Omission-Based Abstraction for Answer Set Programs, Manipulation of Articulated Objects Using Dual-arm Robots via Answer Set Programming, Modality Argumentation Programming, Dealing Automatically with Exceptions by Introducing Specificity in ASP, Probabilistic Reasoning by SAT Solvers, Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web, On Coherence and Consistence in Fuzzy Answer Set Semantics for Residuated Logic Programs, Answer Set Programming: A Primer, Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search, Combining Nonmonotonic Knowledge Bases with External Sources, Reasoning on Multirelational Contextual Hierarchies via Answer Set Programming with Algebraic Measures, A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction, Determining Action Reversibility in STRIPS Using Answer Set and Epistemic Logic Programming, Abduction in logic programming: A new definition and an abductive procedure based on rewriting, Minimal knowledge problem: A new approach, On abstract modular inference systems and solvers, Evaluating epistemic negation in answer set programming, Querying incomplete information in RDF with SPARQL, Combining event calculus and description logic reasoning via logic programming, Equivalence issues in abduction and induction, Nonmonotonic abductive inductive learning, Minimal belief and negation as failure, A sequential model of bargaining in logic programming, An alternative approach to the semantics of disjunctive logic programs and deductive databases, Probabilistic modelling, inference and learning using logical theories, Preferences in artificial intelligence, Querying disjunctive databases through nonmonotonic logics, Data repair of inconsistent nonmonotonic description logic programs, LARS: a logic-based framework for analytic reasoning over streams, Answer set based design of knowledge systems, Equilibrium logic, Possibilistic uncertainty handling for answer set programming, Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin, Quasi-classical reasoning in paraconsistent databases, Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation, Answer set programming based on propositional satisfiability, Non-classical negation in the works of Helena Rasiowa and their impact on the theory of negation, Connectionist modal logic: representing modalities in neural networks, On computing minimal models, Reasoning with minimal models: efficient algorithms and applications, A note on the stable model semantics for logic programs, Jack Minker --- A profile, On the computational cost of disjunctive logic programming: Propositional case, Complexity of computing with extended propositional logic programs, Propositional semantics for disjunctive logic programs, Logic programming and reasoning with incomplete information, The first international competition on computational models of argumentation: results and analysis, Magic Sets and their application to data integration, On extensions of intermediate logics by strong negation, A progression semantics for first-order logic programs, Abduction from logic programs: Semantics and complexity, Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs, Inductive equivalence in clausal logic and nonmonotonic logic programming, Well-founded semantics for defeasible logic, Logic programming as classical inference, Semantic-based construction of arguments: an answer set programming approach, An axiomatic analysis of structured argumentation with priorities, Design and results of the Fifth Answer Set Programming Competition, On updates of hybrid knowledge bases composed of ontologies and rules, Ordered completion for first-order logic programs on finite structures, Computing weighted solutions in ASP: representation-based method vs. search-based method, Extended RDF: computability and complexity issues, Tightly integrated probabilistic description logic programs for representing ontology mappings, Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results, Brave induction: a logical framework for learning from incomplete information, Finding explanations of inconsistency in multi-context systems, On the tractability of minimal model computation for some CNF theories, Heterogeneous active agents. III: Polynomially implementable agents, Modeling biological networks by action languages via answer set programming, An operational formal definition of PROLOG: A specification method and its application, A non-ground realization of the stable and well-founded semantics, Combining explicit negation and negation by failure via Belnap's logic, Reactive multi-context systems: heterogeneous reasoning in dynamic environments, Enhancing context knowledge repositories with justifiable exceptions, A logic of knowledge and justified assumption, Conflict-driven answer set solving: from theory to practice, Matching dependencies: semantics and query answering, John McCarthy's legacy, Stable models and circumscription, From answer set logic programming to circumscription via logic of GK, Semantics and complexity of recursive aggregates in answer set programming, Ordering default theories and nonmonotonic logic programs, General default logic, Probabilistic description logic programs, Syntax and semantics of multi-adjoint normal logic programming, Fixed point semantics for stream reasoning, Pruning external minimality checking for answer set programs using semantic dependencies, Expressive power and complexity of partial models for disjunctive deductive databases, My work with Victor Marek: a mathematician looks at answer set programming, Default logic generalized and simplified, On the relation among answer set solvers, Integrating answer set programming and constraint logic programming, Inductive situation calculus, \textsc{Argonauts}: a working system for motivated cooperative agents, Abductive reasoning through filtering, Specifying causality in action theories: A default logic approach, On quasi-inconsistency and its complexity, Expressing preferences in default logic, Prioritized logic programming and its application to commonsense reasoning, On the equivalence and range of applicability of graph-based representations of logic programs., Relating defeasible and normal logic programming through transformation properties., Dualities between alternative semantics for logic programming and nonmonotonic reasoning, Logic programming and knowledge representation---The A-Prolog perspective, LUPS -- A language for updating logic programs, Yet some more complexity results for default logic, A first order nonmonotonic extension of constructive logic, Semi-equilibrium models for paracoherent answer set programs, Domain expansion for ASP-programs with external sources, A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system, Enhancing disjunctive logic programming systems by SAT checkers, Towards a general theory of topological maps, Nonmonotonic causal theories, Reasoning with infinite stable models, Disjunctive logic programming with types and objects: the \(\mathrm{DLV}^{+}\) system, Advances in WASP, Digital Forensics Evidence Analysis: An Answer Set Programming Approach for Generating Investigation Hypotheses, A Formal Theory of Justifications, Interactive Debugging of Non-ground ASP Programs, On the Relationship Between Two Modular Action Languages: A Translation from MAD into $$\mathcal {ALM}$$, Multi-level Algorithm Selection for ASP, Characterising and Explaining Inconsistency in Logic Programs, A “Conservative” Approach to Extending Answer Set Programming with Non-Herbrand Functions, Parameterized Splitting: A Simple Modification-Based Approach, Simulating Production Rules Using ACTHEX, The Intelligent Grounder of DLV, Toward Question Answering in Travel Domains, Algorithms for Solving Satisfiability Problems with Qualitative Preferences, Applying Visible Strong Equivalence in Answer-Set Program Transformations, Reformulating Action Language $\mathcal{C}$ + in Answer Set Programming, Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming, Disjunctive Programs with Set Constraints, Stepwise Debugging of Description-Logic Programs, A Language for Default Reasoning about Actions, Connecting First-Order ASP and the Logic FO(ID) through Reducts, A New Incarnation of Action Language H, Well-Supported Semantics for Logic Programs with Generalized Rules, Modular materialisation of Datalog programs, Backdoors to Satisfaction, Analogical proportions, Deductive databases for computing certain and consistent answers from mediated data integration systems, Inconsistency Management for Traffic Regulations: Formalization and Complexity Results, The View-Update Problem for Indefinite Databases, Exploiting Unfounded Sets for HEX-Program Evaluation, A Selective Semantics for Logic Programs with Preferences, Multi-modal nonmonotonic logics of minimal knowledge, Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach, Maintenance goals of agents in a dynamic environment: formulation and policy construction, Combining answer set programming with description logics for the semantic web, Semantic forgetting in answer set programming, Outlier detection using default reasoning, A characterization of answer sets for logic programs, Probabilistic reasoning in a classical logic, Parameterized complexity classes beyond para-NP, Lifting symmetry breaking constraints with inductive logic programming, Default reasoning using classical logic, On the negation of a Dempster-Shafer belief structure based on maximum uncertainty allocation, Preserving Strong Equivalence while Forgetting, Modular Paracoherent Answer Sets, Characterizing causal action theories and their implementations in answer set programming, Infinitary equilibrium logic and strongly equivalent logic programs, An argumentation system for defeasible reasoning, Lpopt: a rule optimization tool for answer set programming, Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?, LoCo—A Logic for Configuration Problems, An algebraic approach to revising propositional rule-based knowledge bases, Complexity results for answer set programming with bounded predicate arities and implications, On look-ahead heuristics in disjunctive logic programming, Enhancing DLV instantiator by backjumping techniques, Learning higher-order logic programs, State transition in multi-agent epistemic domains using answer set programming, Towards causality-based conflict resolution in answer set programs, Solving problems in the polynomial hierarchy with ASP(Q), DeduDeep: an extensible framework for combining deep learning and ASP-based models, On the limits of forgetting in answer set programming, Handling and measuring inconsistency in non-monotonic logics, A QBF-based formalization of abstract argumentation semantics, A neural cognitive model of argumentation with application to legal inference and decision making, FLP answer set semantics without circular justifications for general logic programs, An incremental algorithm for generating all minimal models, External sources of knowledge and value invention in logic programming, An introduction to fuzzy answer set programming, Paracoherent answer set computation, Inferring phylogenetic trees using answer set programming, Handling Exceptions in Logic Programming without Negation as Failure, Connectionist computations of intuitionistic reasoning, A general approach to reasoning with probabilities, A rule based knowledge transaction model for mobile environments, New models for generating hard random Boolean formulas and disjunctive logic programs, Determining inference semantics for disjunctive logic programs, Tractable reasoning using logic programs with intensional concepts, Testing in ASP: revisited language and programming environment, Autoepistemic equilibrium logic and epistemic specifications, Abduction-Based Search for Cooperative Answers, Answers set programs for non-transferable utility games: expressiveness, complexity and applications, Multi-context systems in dynamic environments, A multiparametric view on answer set programming, P-log: refinement and a new coherency condition, Exploiting Contextual Knowledge for Hybrid Classification of Visual Objects, Writing Declarative Specifications for Clauses, Rule-based Stream Reasoning for Intelligent Administration of Content-Centric Networks, Measuring Inconsistency in Answer Set Programs, Strong inconsistency, Vicious circle principle, aggregates, and formation of sets in ASP based languages, Any-world assumptions in logic programming, Disjunctive logic programs, answer sets, and the cut rule, Graph-based construction of minimal models, Possible models computation and revision -- a practical approach, The dramatic true story of the frame default, Methods for solving reasoning problems in abstract argumentation -- a survey, Backdoors to tractable answer set programming, Possibilistic nested logic programs and strong equivalence, Assumption-based argumentation for extended disjunctive logic programming, Fuzzy autoepistemic logic and its relation to fuzzy answer set programming, Dynamic Reasoning Systems, Backdoors to Normality for Disjunctive Logic Programs, Witnesses for Answer Sets of Logic Programs, One More Decidable Class of Finitely Ground Programs, Using answer set programming to deal with Boolean networks and attractor computation: application to gene regulatory networks of cells, Reasoning on with Defeasibility in ASP, A general framework for preferences in answer set programming, Thirty years of Epistemic Specifications, ASP and subset minimality: enumeration, cautious reasoning and MUSes, Justifications for Description Logic Knowledge Bases Under the Fixed-Domain Semantics, Hybrid planning for challenging construction problems: an answer set programming approach, Answer-set programs for reasoning about counterfactual interventions and responsibility scores for classification, On combining ontologies and rules, Score-based explanations in data management and machine learning: an answer-set programming approach to counterfactual analysis, Theoretical analysis and implementation of abstract argumentation frameworks with domain assignments, Hybrid metabolic network completion, Computing Diverse Optimal Stable Models, A General Framework for Stable Roommates Problems using Answer Set Programming, Reasoning about Cardinal Directions between 3-Dimensional Extended Objects using Answer Set Programming, Explanation Generation for Multi-Modal Multi-Agent Path Finding with Optimal Resource Utilization using Answer Set Programming, A Glimpse on Gerhard Brewka’s Contributions to Artificial Intelligence, Cumulativity Tailored for Nonmonotonic Reasoning, Symbolic knowledge extraction from trained neural networks: A sound approach, Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets, Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings, Answering the “why” in answer set programming – A survey of explanation approaches, Debugging Non-ground ASP Programs: Technique and Graphical Tools, Abstraction for non-ground answer set programs, Normal Form Nested Programs, Indefinite abductive explanations, Characterizing D-WFS: Confluence and iterated GCWA, SMS and ASP: Hype or TST?, Answer Set Programming without Unstratified Negation, Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There, Declarative Semantics for Active Integrity Constraints, Computable Functions in ASP: Theory and Implementation, Composing Normal Programs with Function Symbols, Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence, Program Correspondence under the Answer-Set Semantics: The Non-ground Case
