%{search_type} search results

• Part 1 Prelude: introduction - what this book is about, style, aims and intended audience, book overview, how to use this book, acknowledgments
• predicate logic - the syntax of predicate logic, the semantics of predicate logic, proof theory. Part 2 Default logic: default reasoning - the notion of a default, the syntax of Default logic
• informal discussion of the semantics
• operational semantics of Default logic - the definitions of extensions, some examples, a prototype prolog implementation, an alternative characterization of extensions, some properties of Default logic
• normal Default theories - normal defaults, some theoretical properties, a proof theory for normal default theories, limitations of normal default theories
• semi-normal Default theories - ordered, semi-normal default theories, proof of the existence of extensions
• translation into semi-normal from
• alterative approaches - properties of Default logic - properties of Default logic, justified Default logic, constrained Default logic, interconnections and examples, computability and complexity considerations
• priority among defaults - PDL - prioritized Default logic, PRDL - reasoning about priorities, an example from legal reasoning, an alternative characterization of extensions, properties of PDRL. Part 3 Classical approaches to nonmonotonic reasoning: autoepistemic logic - the language of autoepistemic logic, the semantics of autoepistemic formulae, expansions of autoepistemic theories, stable sets and their properties
• computing expansions of AE-theories - motivation and description of the method, some examples, correctness proofs, a prototype implementation in prolog
• embedding Default logic into AE-logic - expressing default theories as AE-theories, minimal expansions, moderately grounded expansions, strongly grounded expansions, proofs
• circumscription - predicate circumscription, minimal models, consistency and expressive power, variable circumscription, prioritized circumscription. Part 4 Abstract and dynamic approaches to nonmonotonic reasoning: nonmonotonic inference relations - the notion of an inference relation, basic properties - pure conditions, basic properties - interaction with logical connective, inference relations in default logic, preferential models, further properties of inference relations
• belief revision - introduction, expansion, contraction, revision, interrelationships, epistemic entrenchment ordering, odds and ends. (Part contents).
• (source: Nielsen Book Data)

Nonmonotonic reasoning provides formal methods that enable intelligent systems to operate adequately when faced with incomplete or changing information. In particular, it provides rigorous mechanisms for taking back conclusions that, in the presence of new information, turn out to be wrong and for deriving new, alternative conclusions instead. Nonmonotonic reasoning methods provide rigor similar to that of classical reasoning; they form a base for validation and verification and therefore increase confidence in intelligent systems that work with incomplete and changing information. Following a brief introduction to the concepts of predicate logic that are needed in the subsequent chapters, this book presents an in depth treatment of default logic. Other subjects covered include the major approaches of autoepistemic logic and circumscription, belief revision and its relationship to nonmonotonic inference, and briefly, the stable and well-founded semantics of logic programs.
(source: Nielsen Book Data)

• Preface
• Monotonic Reasoning
• Set Theory
• Propositional Logic
• Consequences of a Theory
• Nonmonotonic Reasoning
• Foundations
• Nonmonotonic Systems
• Objections
• Argumentation Systems
• Formal Development
• Basic Properties
• Separable Argumentation Systems
• Remarks
• Reiter's Default Logic
• Syntactic Development
• Semantics of Default Logic
• Translation
• Autoepistemic Logic
• Autoepistemic Expansions
• Embedding
• Relations To Default Logic
• Inverse Transformation
• Modified Default Logic
• Modified Extensions
• Semantics for Modified Default Logic
• Characterisation of Modified Extensions
• Alternative Formalisations
• Constrained Default Logic
• Hypothetical Default Logic
• Constrained vs. Hypothetical Default Reasoning
• Super-normal Default Theories
• Minimisation and Falsification
• Circumscription
• Negation as Failure
• Argumentation Systems and Minimisation
• Bibliography
• Index.
• (source: Nielsen Book Data)

The capability to reason in a world full of uncertainties, vagueness and ignorance is what distinguishes humans. This ability to argument in a partially known world is the informal definition of common-sense reasoning. The question how common-sense reasoning is performed occupied humanity since we can think of. Last century this issue reached an immense importance. Especially during the last three decades the study of common-sense reasoning became one of the major research topics in Artificial Intelligence (AI). Several formalisms to capture the mechanism of common-sense reasoning have been proposed so far. This book concentrates on presenting the most important formalisms for common-sense reasoning, and, showing that one of the discussed formalisms serves perfectly to capture the mechanism of common-sense reasoning, since this formalism subsumes all other in this book introduced formalisms dealing with common-sense reasoning.
(source: Nielsen Book Data)

• 1. Introduction
• 2. Preference logics
• 3. Nonmonotonic inference relations
• 4. Consistency based logics
• 5. Abduction
• 6. Semantics for logic programs with negation
• 7. Nonmonotonicity in logic programming.
• (source: Nielsen Book Data)

Nonmonotonic reasoning in its broadest sense is reasoning to conclusions on the basis of incomplete information. Given more information, previously drawn inferences may be retracted. Commonsense reasoning has a nonmonotonic component; it has been argued that almost all commonsense inferences are of this sort. From the end of the 1980s to the present there has been an explosion in research in nonmonotonic reasoning. It is now possible to understand more clearly the properties of the major formalisms from a metatheoretical point of view, the relationships among the formalisms and their connection to independently developed proof methods. The goal of this monograph is to make this understanding more accessible.
(source: Nielsen Book Data)

• Scott Consequence Relations
• Biconsequence Relations
• Four-Valued Logics
• Nonmonotonic Semantics
• Default Consequence Relations
• Argumentation Theory
• Production and Causal Inference
• Epistemic Consequence Relations
• Modal Nonmonotonic Logics.
• (source: Nielsen Book Data)

Many approaches in the field of nonmonotonic and "commonsense" reasoning are actually different representations of the same basic ideas and constructions. This book gives a logical formalization of the original, explanatory approach to nonmonotonic reasoning. It uses the basic formalism of biconsequence relations, as well as derived systems of default, autoepistemic and causal inference, to cover in a single framework such diverse systems as default logic, autoepistemic and modal nonmonotonic logics, input/output and causal logics, argumentation theory, and semantics of general logic programs with negation as failure. This approach provides a clear separation between logical (monotonic) and nonmonotonic aspects of nonmonotonic reasoning. The separation allows, in particular, to single out the logics underlying modern logic programming and restore thereby the connection between logic programming and logic.
(source: Nielsen Book Data)

Conditionals are omnipresent, in everyday life as well as in scientific environments; they represent generic knowledge acquired inductively or learned from books. They tie a flexible and highly interrelated network of connections along which reasoning is possible and which can be applied to different situations. Therefore, conditionals are important, but also quite problematic objects in knowledge representation. This book presents a new approach to conditionals which captures their dynamic, non-proportional nature particularly well by considering conditionals as agents shifting possible worlds in order to establish relationships and beliefs. This understanding of conditionals yields a rich theory which makes complex interactions between conditionals transparent and operational. Moreover, it provides a unifying and enhanced framework for knowledge representation, nonmonotonic reasoning, belief revision, and even for knowledge discovery.
(source: Nielsen Book Data)

• Technical Contributions
• Syntactic ASP Forgetting with Forks
• Modal Logic S5 in Answer Set Programming with Lazy Creation of Worlds
• Enumeration of minimal models and MUSes in WASP
• Statistical Statements in Probabilistic Logic Programming
• A Comparative Study of Three Neural-Symbolic Approaches to Inductive Logic Programming
• A Definition of Sceptical Semantics in the Constellations Approach
• SHACL: A Description Logic in Disguise
• Tunas - Fishing for diverse Answer Sets: a Multi-Shot Trade up Strategy
• Emotional Reasoning in an Action Language for Emotion-Aware Planning
• Metric Temporal Answer Set Programming over Timed Traces
• Epistemic Logic Programs: a study of some properties
• Deep learning for the generation of heuristics in answer set programming: a case study of graph coloring
• A Qualitative Temporal Extension of Here-and-There Logic
• Representing Abstract Dialectical Frameworks with Binary Decision Diagrams
• Arguing Correctness of ASP Programs with Aggregates
• Efficient Computation of Answer Sets via SAT Modulo Acyclicity and Vertex Elimination
• IASCAR: Incremental Answer Set Counting by Anytime Refinement
• Reasoning about actions with EL ontologies and temporal answer sets for DLTL
• Inference to the Stable Explanations
• Semantics for Conditional Literals via the SM Operator
• State Transition in Multi-agent Epistemic Domains using Answer Set Programming
• Towards Provenance in Heterogeneous Knowledge Bases
• Computing Smallest MUSes of Quantified Boolean Formulas
• Pinpointing Axioms in Ontologies via ASP
• Interlinking Logic Programs and Argumentation Frameworks
• Gradient-Based Supported Model Computation in Vector Spaces
• Towards Causality-Based Conflict Resolution in Answer Set Programs
• xASP: An Explanation Generation System for Answer Set Programming
• Systems
• Solving Problems in the Polynomial Hierarchy with ASP(Q)
• A Practical Account into Counting Dung’s Extensions by Dynamic Programming
• clingraph: ASP-based Visualization
• A Machine Learning System to Improve the Performance of ASP
• QMaxSATpb: A Certified MaxSAT Solver
• Applications
• Knowledge-Based Support for Adhesive Selection
• ASP for Flexible Payroll Management
• Analysis of Cyclic Fault Propagation via ASP
• Learning to Rank the Distinctiveness of Behaviour in Serial Offending
• Optimising Business Process Discovery using Answer Set Programming
• DeduDeep: an Extensible Framework for Combining Deep Learning and ASP-based Models.

This book constitutes the refereed proceedings of the 16th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2022, held in Genova, Italy, in September 2022. The 34 full papers and 5 short papers included in this book were carefully reviewed and selected from 57 submissions. They were organized in topical sections as follows: Technical Contributions; Systems; Applications.

• Applications.- Train scheduling with hybrid ASP.- Telco Network Inventory Validation with NoHR.- An ASP-based Framework for the Manipulation of Articulated Objects using Dual-arm Robots.- C-ASP: Continuous ASP-based Reasoning over RDF Streams.- Internet Routing and Non-Monotonic Reasoning.- Argumentation.- Assessing arguments with schemes and fallacies.- Simple Contrapositive Assumption-Based Frameworks.- Argumentation-based Explanations for Answer Sets using ADF.- Foundations and Complexity.- Treewidth and Counting Projected Answer Sets.- Splitting Epistemic Logic Programs.- Founded World Views with Autoepistemic Equilibrium Logic.- Towards Dynamic Answer Set Programming over finite traces.- A Sequent-Type Calculus for Three-Valued Default Logic, or: Tweety Meets Quartum Non Datur.- Knowledge Representation and Reasoning.- Diagnosing Data Pipeline Failures Using Action Languages.- Repair-Based Degrees of Database Inconsistency.- Elect: An Inconsistency Handling Approach for Partially Preordered Lightweight Ontologies.- Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Action Language pBC+.- Systems.- Evaluation of disjunctive programs in WASP.- telinge = ASP + Time.- Verifying Strong Equivalence of Programs in the Input Language of GRINGO.- The return of XORRO.- Degrees of Laziness in Grounding: Effects of Lazy-Grounding Strategies on ASP Solving.- Enhancing DLV for Large-Scale Reasoning.- Pruning External Minimality Checking for ASP Using Semantic Dependencies.- Declarative local search for predicate logic.
• (source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 15th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2019, held in Philadelphia, PA, USA, in June 2019.The 22 full papers and 3 short papers presented in this volume were carefully reviewed and selected from a total of 39 submissions. The papers were organized in topical sections named: applications; argumentation; foundations and complexity; knowledge representation and reasoning; and systems.
(source: Nielsen Book Data)

• Invited Talks/Competition.- Logic Programming and Nonmonotonic Reasoning: From Theory to Systems and Applications.- Policy-Based Computing: From Systems and Applications to Theory.- The First Answer Set Programming System Competition.- Technical Papers.- cr-models: An Inference Engine for CR-Prolog.- Debugging ASP Programs by Means of ASP.- A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation.- Complexity of Default Logic on Generalized Conjunctive Queries.- A Preference-Based Framework for Updating Logic Programs.- Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions.- On the Complexity of Answer Set Programming with Aggregates.- Experimenting with Look-Back Heuristics for Hard ASP Programs.- Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains.- Conflict-Driven Answer Set Enumeration.- Head-Elementary-Set-Free Logic Programs.- A Deductive System for PC(ID).- Modularity Aspects of Disjunctive Stable Models.- A Characterization of Strong Equivalence for Logic Programs with Variables.- A Unified Semantics for Constraint Handling Rules in Transaction Logic.- Conditional Planning with External Functions.- Logic Programs with Abstract Constraints: Representaton, Disjunction and Complexities.- General Default Logic.- System Descriptions.- The
• System: Logic Programming Meets Outlier Detection.- clasp: A Conflict-Driven Answer Set Solver.- GrinGo: A New Grounder for Answer Set Programming.- Using Answer Sets to Solve Belief Change Problems.- An Smodels System with Limited Lookahead Computation.- Programming Applications in CIFF.- CPP: A Constraint Logic Programming Based Planner with Preferences.- Posters.- An Application of Defeasible Logic Programming to Decision Making in a Robotic Environment.- On the Effectiveness of Looking Ahead in Search for Answer Sets.- Enhancing ASP Systems for Planning with Temporal Constraints.- Semantics for Possibilistic Disjunctive Programs.- Modularity in smodels Programs.
• (source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 8th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2005, held in Diamante, Italy in September 2005. The 25 revised full papers, 16 revised for the system and application tracks presented together with 3 invited papers were carefully reviewed and selected for presentation. Among the topics addressed are semantics of new and existing languages; relationships between formalisms; complexity and expressive power; LPNMR systems: development of inference algorithms and search heuristics, updates and other operations, uncertainty, and applications in planning, diagnosis, system descriptions, comparisons and evaluations; software engineering, decision making, and other domains; LPNMR languages: extensions by new logical connectives and new inference capabilities, applications in data integration and exchange systems, and methodology of representing knowledge.
(source: Nielsen Book Data)
This book constitutes the refereed proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2007, held in Tempe, AZ, USA, May 2007. This conference encompasses theoretical studies, design and implementation of logic based programming languages and database systems, and development of experimental systems.
(source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 8th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2005, held in Diamante, Italy in September 2005. The 25 revised full papers, 16 revised for the system and application tracks presented together with 3 invited papers were carefully reviewed and selected for presentation. Among the topics addressed are semantics of new and existing languages; relationships between formalisms; complexity and expressive power; LPNMR systems: development of inference algorithms and search heuristics, updates and other operations, uncertainty, and applications in planning, diagnosis, system descriptions, comparisons and evaluations; software engineering, decision making, and other domains; LPNMR languages: extensions by new logical connectives and new inference capabilities, applications in data integration and exchange systems, and methodology of representing knowledge.
(source: Nielsen Book Data)

• Invited Papers.- Constraints and Probabilistic Networks: A Look At The Interface.- Toward A Universal Inference Engine.- Towards Systematic Benchmarking in Answer Set Programming: The Dagstuhl Initiative.- Regular Papers.- Semantics for Dynamic Logic Programming: A Principle-Based Approach.- Probabilistic Reasoning With Answer Sets.- Answer Sets: From Constraint Programming Towards Qualitative Optimization.- A Logic of Non-monotone Inductive Definitions and Its Modularity Properties.- Reasoning About Actions and Change in Answer Set Programming.- Almost Definite Causal Theories.- Simplifying Logic Programs Under Uniform and Strong Equivalence.- Towards Automated Integration of Guess and Check Programs in Answer Set Programming.- Towards Automated Integration of Guess and Check Programs in Answer Set Programming.- Graphs and Colorings for Answer Set Programming: Abridged Report.- Nondefinite vs. Definite Causal Theories.- Logic Programs With Monotone Cardinality Atoms.- Set Constraints in Logic Programming.- Verifying the Equivalence of Logic Programs in the Disjunctive Case.- Uniform Equivalence for Equilibrium Logic and Logic Programs.- Partial Stable Models for Logic Programs with Aggregates.- Improving the Model Generation/Checking Interplay to Enhance the Evaluation of Disjunctive Programs.- Using Criticalities as a Heuristic for Answer Set Programming.- Planning with Preferences Using Logic Programming.- Planning with Sensing Actions and Incomplete Information Using Logic Programming.- Deduction in Ontologies via ASP.- Strong Equivalence for Causal Theories.- Answer Set Programming with Clause Learning.- Properties of Iterated Multiple Belief Revision.- System Descriptions.- System Description: DLV with Aggregates.- GNT - A Solver for Disjunctive Logic Programs.- LPEQ and DLPEQ - Translators for Automated Equivalence Testing of Logic Programs.- DLV DB : Bridging the Gap between ASP Systems and DBMSs.- Cmodels
• -2: SAT-based Answer Set Solver Enhanced to Non-tight Programs.- WSAT(CC) - A Fast Local-Search ASP Solver.- Smodels with CLP-A Treatment of Aggregates in ASP.- nlp: A Compiler for Nested Logic Programming.
• (source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2004, held in Fort Lauderdale, Florida, USA in January 2004. The 24 revised full papers presented together with 8 system descriptions were carefully reviewed and selected for presentation. Among the topics addressed are declarative logic programming, nonmonotonic reasoning, knowledge representation, combinatorial search, answer set programming, constraint programming, deduction in ontologies, and planning.
(source: Nielsen Book Data)
The papers in this collection were presented at the 7th International Con- rence on Logic Programming and Nonmonotonic Reasoning (LPNMR-7) in Fort Lauderdale, Florida, USA, during January 6-8, 2004. The previous meetings in this series were held in Washington, DC, USA (1991), Lisbon, Portugal (1993), Lexington, USA (1995), Dagstuhl, Germany (1997), El Paso, USA (1999), and Vienna, Austria (2001). LPNMR conferences are a forum for exchanging ideas on declarative logic programming, nonmonotonic reasoning and knowledge representation. In the 1980sresearchersworkingintheareaofnonmonotonicreasoningdiscovere dthat their formalisms could be used to describe the behavior of negation as failure in Prolog, andthe?rstLPNMRmeetingwasconvenedforthepurposeofdiscussing thisrelationship.Thisworkhasledtothecreationoflogicprogrammingsy stems of a new kind, answer set solvers, and to the emergence of a new approach to solving combinatorial search problems, called answer set programming. The highlights of LPNMR-7 were three invited talks, given by Rina Dechter (University of California, Irvine), Henry Kautz (University of Washington) and Torsten Schaub (University of Potsdam). The program also included 24 regular papers selected after a rigorous review process, 8 system descriptions, and 2 panels. We would like to thank the Program Committee members and additional reviewers for careful, unbiased evaluation of the submitted papers. We are also grateful to Paolo Ferraris for help with publicizing the Call for Papers, to Fred Ho?man for help with local organizational matters, and to Matti J.. arvisalo for help with the organization of the electronic Program Committee meeting.
(source: Nielsen Book Data)

• Invited Papers.- Constraints and Probabilistic Networks: A Look At The Interface.- Toward A Universal Inference Engine.- Towards Systematic Benchmarking in Answer Set Programming: The Dagstuhl Initiative.- Regular Papers.- Semantics for Dynamic Logic Programming: A Principle-Based Approach.- Probabilistic Reasoning With Answer Sets.- Answer Sets: From Constraint Programming Towards Qualitative Optimization.- A Logic of Non-monotone Inductive Definitions and Its Modularity Properties.- Reasoning About Actions and Change in Answer Set Programming.- Almost Definite Causal Theories.- Simplifying Logic Programs Under Uniform and Strong Equivalence.- Towards Automated Integration of Guess and Check Programs in Answer Set Programming.- Towards Automated Integration of Guess and Check Programs in Answer Set Programming.- Graphs and Colorings for Answer Set Programming: Abridged Report.- Nondefinite vs. Definite Causal Theories.- Logic Programs With Monotone Cardinality Atoms.- Set Constraints in Logic Programming.- Verifying the Equivalence of Logic Programs in the Disjunctive Case.- Uniform Equivalence for Equilibrium Logic and Logic Programs.- Partial Stable Models for Logic Programs with Aggregates.- Improving the Model Generation/Checking Interplay to Enhance the Evaluation of Disjunctive Programs.- Using Criticalities as a Heuristic for Answer Set Programming.- Planning with Preferences Using Logic Programming.- Planning with Sensing Actions and Incomplete Information Using Logic Programming.- Deduction in Ontologies via ASP.- Strong Equivalence for Causal Theories.- Answer Set Programming with Clause Learning.- Properties of Iterated Multiple Belief Revision.- System Descriptions.- System Description: DLV with Aggregates.- GNT - A Solver for Disjunctive Logic Programs.- LPEQ and DLPEQ - Translators for Automated Equivalence Testing of Logic Programs.- DLV DB : Bridging the Gap between ASP Systems and DBMSs.- Cmodels
• -2: SAT-based Answer Set Solver Enhanced to Non-tight Programs.- WSAT(CC) - A Fast Local-Search ASP Solver.- Smodels with CLP-A Treatment of Aggregates in ASP.- nlp: A Compiler for Nested Logic Programming.
• (source: Nielsen Book Data)

The papers in this collection were presented at the 7th International Con- rence on Logic Programming and Nonmonotonic Reasoning (LPNMR-7) in Fort Lauderdale, Florida, USA, during January 6-8, 2004. The previous meetings in this series were held in Washington, DC, USA (1991), Lisbon, Portugal (1993), Lexington, USA (1995), Dagstuhl, Germany (1997), El Paso, USA (1999), and Vienna, Austria (2001). LPNMR conferences are a forum for exchanging ideas on declarative logic programming, nonmonotonic reasoning and knowledge representation. In the 1980sresearchersworkingintheareaofnonmonotonicreasoningdiscovere dthat their formalisms could be used to describe the behavior of negation as failure in Prolog, andthe?rstLPNMRmeetingwasconvenedforthepurposeofdiscussing thisrelationship.Thisworkhasledtothecreationoflogicprogrammingsy stems of a new kind, answer set solvers, and to the emergence of a new approach to solving combinatorial search problems, called answer set programming. The highlights of LPNMR-7 were three invited talks, given by Rina Dechter (University of California, Irvine), Henry Kautz (University of Washington) and Torsten Schaub (University of Potsdam). The program also included 24 regular papers selected after a rigorous review process, 8 system descriptions, and 2 panels. We would like to thank the Program Committee members and additional reviewers for careful, unbiased evaluation of the submitted papers. We are also grateful to Paolo Ferraris for help with publicizing the Call for Papers, to Fred Ho?man for help with local organizational matters, and to Matti J.. arvisalo for help with the organization of the electronic Program Committee meeting.
(source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2001, held in Vienna, Austria in September 2001. The 22 revised full papers and eleven system descriptions presented with five invited papers were carefully reviewed and rigorously selected. Among the topics addressed are computational logic, declarative information extraction, model checking, inductive logic programming, default theories, stable logic programming, program semantics, incomplete information processing, concept learning, declarative specification, Prolog programming, many-valued logics, etc.
(source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR '99, held in El Paso, Texas, USA, in December 1999.The volume presents 26 contributed papers and four invited talks, three appearing as extended abstracts and one as a full paper. Topics covered include logic programming, non-monotonic reasoning, knowledge representation, semantics, complexity, expressive power, and implementation and applicatons.
(source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR '97, held in Dagstuhl Castle, Germany, in July 1997.The volume presents 19 revised regular papers together with 10 system descriptions and five abstracts of invited presentations. The papers included report state-of-the-art research and development in the interdisciplinary area of logic programming and logical foundations of artificial intelligence.
(source: Nielsen Book Data)

This book constitutes the thoroughly refereed post-workshop proceedings of the 6th International Workshop on Non-Monotonic Extensions of Logic Programming, NMELP '96, held in Bad Honnef, Germany, in September 1996.The nine full papers presented in the volume in revised version were carefully reviewed and selected from a total of 18 submissions; the set of papers addresses theoretical, applicational and implementational issues and reflects the current state of the art in the area of non-monotonic extensions of logic programming. An introductory survey by the volume editors entitled "Prolegomena to Logic Programming for Non-Monotonic Reasoning" deserves special mentioning; it contains a bibliography listing 136 entries.
(source: Nielsen Book Data)

• Towards Reactive Multi-Context Systems / Gerhard Brewka
• Logic Programming in the 1970s / Robert Kowalski
• Integrating Temporal Extensions of Answer Set Programming / Felicidad Aguado, Gilberto Pérez
• Forgetting under the Well-Founded Semantics / José Júlio Alferes, Matthias Knorr
• The Fourth Answer Set Programming Competition: Preliminary Report / Mario Alviano, Francesco Calimeri
• WASP: A Native ASP Solver Based on Constraint Learning / Mario Alviano, Carmine Dodaro
• The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics / Mario Alviano, Wolfgang Faber
• ARVis: Visualizing Relations between Answer Sets / Thomas Ambroz, Günther Charwat
• Symbolic System Synthesis Using Answer Set Programming / Benjamin Andres, Martin Gebser
• Accurate Computation of Sensitizable Paths Using Answer Set Programming / Benjamin Andres, Matthias Sauer.

• Hex Semantics via Approximation Fixpoint Theory / Christian Antić, Thomas Eiter, Michael Fink
• Encoding Higher Level Extensions of Petri Nets in Answer Set Programming / Saadat Anwar, Chitta Baral, Katsumi Inoue
• Cplus 2ASP: Computing Action Language C + in Answer Set Programming / Joseph Babb, Joohyung Lee
• Towards Answer Set Programming with Sorts / Evgenii Balai, Michael Gelfond
• Prolog and ASP Inference under One Roof / Marcello Balduccini, Yuliya Lierler
• Event-Object Reasoning with Curated Knowledge Bases: Deriving Missing Information / Chitta Baral, Nguyen H. Vo
• Towards Query Answering in Relational Multi-Context Systems / Rosamaria Barilaro, Michael Fink
• Spectra in Abstract Argumentation: An Analysis of Minimal Change / Ringo Baumann, Gerhard Brewka
• Normalizing Cardinality Rules Using Merging and Sorting Constructions / Jori Bomanson, Tomi Janhunen.

• Experience Based Nonmonotonic Reasoning / Daniel Borchmann
• An ASP Application in Integrative Biology: Identification of Functional Gene Units / Philippe Bordron, Damien Eveillard
• Evaluating Answer Set Clause Learning for General Game Playing / Timothy Cerexhe, Orkunt Sabuncu
• VCWC: A Versioning Competition Workflow Compiler / Günther Charwat, Giovambattista Ianni
• A Sequential Model for Reasoning about Bargaining in Logic Programs / Wu Chen, Dongmo Zhang, Maonian Wu
• Extending the Metabolic Network of Ectocarpus Siliculosus Using Answer Set Programming / Guillaume Collet, Damien Eveillard
• Negation as a Resource: A Novel View on Answer Set Semantics / Stefania Costantini, Andrea Formisano
• AGM-Style Belief Revision of Logic Programs under Answer Set Semantics / James Delgrande, Pavlos Peppas
• Efficient Approximation of Well-Founded Justification and Well-Founded Domination / Christian Drescher, Toby Walsh.

• Approximate Epistemic Planning with Postdiction as Answer-Set Programming / Manfred Eppe, Mehul Bhatt, Frank Dylla
• Combining Equilibrium Logic and Dynamic Logic / Luis Fariñas del Cerro, Andreas Herzig
• ActHEX: Implementing HEX Programs with Action Atoms / Michael Fink, Stefano Germano
• Debugging Answer-Set Programs with Ouroboros -- Extending the SeaLion Plugin / Melanie Frühstück, Jörg Pührer
• Game Semantics for Non-monotonic Intensional Logic Programming / Chrysida Galanaki, Christos Nomikos
• Matchmaking with Answer Set Programming / Martin Gebser, Thomas Glase, Orkunt Sabuncu
• Ricochet Robots: A Transverse ASP Benchmark / Martin Gebser, Holger Jost, Roland Kaminski
• Decidability and Implementation of Parametrized Logic Programs / Ricardo Gonçalves, José Júlio Alferes
• Non-monotonic Temporal Goals / Ricardo Gonçalves, Matthias Knorr.

• On Equivalent Transformations of Infinitary Formulas under the Stable Model Semantics / Amelia Harrison, Vladimir Lifschitz
• An Application of ASP to the Field of Second Language Acquisition / Daniela Inclezan
• Turner's Logic of Universal Causation, Propositional Logic, and Logic Programming / Jianmin Ji, Fangzhen Lin
• Concrete Results on Abstract Rules / Markus Krötzsch, Despoina Magka
• Linear Logic Programming for Narrative Generation / Chris Martens, Anne-Gwenn Bosser
• Implementing Informal Semantics of ASP / Artur Mikitiuk, Miroslaw Truszczynski
• Implementing Belief Change in the Situation Calculus and an Application / Maurice Pagnucco, David Rajaratnam
• Debugging Non-ground ASP Programs with Choice Rules, Cardinality and Weight Constraints / Axel Polleres, Melanie Frühstück
• Conflict-Based Program Rewriting for Solving Configuration Problems / Anna Ryabokon, Gerhard Friedrich.

• Program Updating by Incremental and Answer Subsumption Tabling / Ari Saptawijaya, Luís Moniz Pereira
• Characterization Theorems for Revision of Logic Programs / Nicolas Schwind, Katsumi Inoue
• Flexible Combinatory Categorial Grammar Parsing Using the CYK Algorithm and Answer Set Programming / Peter Schüller
• Early Recovery in Logic Program Updates / Martin Slota, Martin Baláž, João Leite
• Preference Handling for Belief-Based Rational Decisions / Samy Sá, João Alcântara
• Logic-Based Techniques for Data Cleaning: An Application to the Italian National Healthcare System / Giorgio Terracina, Alessandra Martello
• Justifications for Logic Programming / Carlos Viegas Damásio, Anastasia Analyti
• Belief Change in Nonmonotonic Multi-Context Systems / Yisong Wang, Zhiqiang Zhuang, Kewen Wang
• On Optimal Solutions of Answer Set Optimization Problems / Ying Zhu, Miroslaw Truszczynski.

This volume contains the refereed proceedings of the 12th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2013, held in September 2013 in Corunna, Spain. The 34 revised full papers (22 technical papers, 9 application description, and 3 system descriptions) and 19 short papers (11 technical papers, 3 application descriptions, and 5 system descriptions) presented together with 2 invited talks, were carefully reviewed and selected from 91 submissions. Being a forum for exchanging ideas on declarative logic programming, nonmonotonic reasoning, and knowledge representation, the conference aims to facilitate interactions between those researchers and practitioners interested in the design and implementation of logic-based programming languages and database systems, and those who work in the area of knowledge representation and nonmonotonic reasoning.
(source: Nielsen Book Data)

• Opening: Homage to Michael Gelfond on His 65th Birthday
• Foundations: ASP and Theories of LP, KR, and NMR: Answer Set Programming's Contributions to Classical Logic: An Analysis of ASP Methodology
• Closure and Consistency Rationalities in Logic-Based Argumentation
• Manifold Answer-Set Programs and Their Applications
• On the Minimality of Stable Models
• Challenges in Answer Set Solving
• Exploring Relations between Answer Set Programs
• Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses
• Effectively Reasoning about Infinite Sets in Answer Set Programming
• Inspecting Side-Effects of Abduction in Logic Programs
• Argumentation and Answer Set Programming
• Interlude: Cantor's Paradise Regained: Constructive Mathematics from Brouwer to Kolmogorov to Gelfond
• Interlude: Recollections on Michael Gelfond's 65th Birthday
• ASP and Dynamic Domains: Evolving Logic Programs with Temporal Operators
• On Representing Actions in Multi-agent Domains
• Nonmonotonic Multi-Context Systems: A Flexible Approach for Integrating Heterogeneous Knowledge Sources
• Perspectives on Logic-Based Approaches for Reasoning about Actions and Change
• Refinement of History-Based Policies
• Translating General Game Descriptions into an Action Language
• Revisiting Epistemic Specifications
• Interlude: Answer Set; Programming?
• Interlude: Michael Gelfond: Essay in Honour of His 65th Birthday
• ASP
• Applications and Tools: PLINI: A Probabilistic Logic Program Framework for Inconsistent News Information
• ASP as a Cognitive Modeling Tool: Short-Term Memory and Long-Term Memor
• A Temporally Expressive Planner Based on Answer Set Programming with Constraints: Preliminary Design
• Applications of Answer Set Programming in Phylogenetic Systematics
• ASP at Work: Spin-off and Applications of the DLV System
• Combining Answer Set Programming and Prolog: The ASP-PROLOG System
• On the Practical Side of Answer Set Programming
• ASTREA: Answer Sets for a Trusted Reasoning Environment for Agents
• Ending: Tea Times with Gelfond.

This Festschrift volume, published in honor of Michael Gelfond on the occasion of his 65th birthday, contains a collection of papers written by his closest friends and colleagues. Several of these papers were presented during the Symposium on Constructive Mathematics in Computer Science, held in Lexington, KY, USA on October 25-26, 2010. The 27 scientific papers included in the book focus on answer set programming. The papers are organized in sections named "Foundations: ASP and Theories of LP, KR, and NMR", "ASP and Dynamic Domains", and "ASP - Applications and Tools."