ErgoAI (abbr. Ergo) is a high level, multi-paradigm logicprogramming language and system developed by Coherent Knowledge Systems as an enhancement of and a successor to the popular Flora-2 system. Ergo is oriented to...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
ErgoAI (abbr. Ergo) is a high level, multi-paradigm logicprogramming language and system developed by Coherent Knowledge Systems as an enhancement of and a successor to the popular Flora-2 system. Ergo is oriented towards scalable knowledge representation and reasoning, and can exploit both structured knowledge as well as knowledge derived from external sources such as vector embeddings. From the start, Ergo (and Flora-2 before it) were designed to exploit the well-founded semantics for reasoning in a multi-paradigm environment, including object-based logic (F-logic) with non-monotonic inheritance;higher order syntax in the style of HiLog;defeasibility of rules;semantically clean transactional updates;and extensive use of subgoal delay for better logical behavior and performance. Although Ergo programs are compiled into XSB and adopt many Prolog features, Ergo is altogether a different language with functionality equivalent to major Prologs.
the proceedings contain 39 papers. the topics discussed include: a computational logic approach to heterogeneous agent systems;on the complexity of model checking and inference in minimal models;data integration needs...
ISBN:
(纸本)3540425934
the proceedings contain 39 papers. the topics discussed include: a computational logic approach to heterogeneous agent systems;on the complexity of model checking and inference in minimal models;data integration needs reasoning;nonmonotonic inductive logicprogramming;on the effect of default negation on the expressiveness of disjunctive rules;on the expressibility of stable logicprogramming;on the relationship between defeasible logic and well-founded semantics;a comparative study of well-founded semantics for disjunctive logic programs;reasoning with open logic programs;representation of incomplete knowledge by induction of default theories;explicitly using default knowledge in concept learning: an extended description logics plus strict and default rules;declarative specification and solution of combinatorial auctions using logicprogramming;and planning with different forms of domain-dependent control knowledge - an answer set programming approach.
the proceedings contain 48 papers. the special focus in this conference is on logicprogramming and nonmonotonicreasoning. the topics include: Stable models for temporal theories;algorithmic decision theory meets log...
ISBN:
(纸本)9783319232638
the proceedings contain 48 papers. the special focus in this conference is on logicprogramming and nonmonotonicreasoning. the topics include: Stable models for temporal theories;algorithmic decision theory meets logic;relational and semantic data mining;shift design with answer set programming;advances in WASP;improving coordinated SMT-based system synthesis by utilizing domain-specific heuristics;integrating ASP into ROS for reasoning in robots;automated inference of rules with exception from past legal cases using ASP;solving constraint satisfaction problems with answer set programming;a theory of intentions for intelligent agents;answer set programming modulo acyclicity;a framework for goal-directed query evaluation with negation;implementing preferences with asprin;diagnosing automatic whitelisting for dynamic remarketing ads using hybrid ASP;performance tuning in answer set programming;enablers and inhibitors in causal justifications of logic programs;efficient problem solving on tree decompositions using binary decision diagrams;knowledge acquisition via non-monotonic reasoning in distributed heterogeneous environments;a formal theory of justifications;a new computational logic approach to reason with conditionals;interactive debugging of non-ground ASP programs;linking open-world knowledge bases using nonmonotonic rules;ASP, amalgamation, and the conceptual blending workflow;diagnostic reasoning for robotics using action languages;connecting object-oriented and logicprogramming;reasoning with forest logic programs using fully enriched automata;ASP solving for expanding universes and combining heuristics for configuration problems using answer set programming;infinitary equilibrium logic and strong equivalence and compacting boolean formulae for inference in probabilistic logicprogramming.
the proceedings contain 31 papers. the special focus in this conference is on logicprogramming and nonmonotonicreasoning. the topics include: the design of the seventh answer set programming competition;from logic p...
ISBN:
(纸本)9783319616599
the proceedings contain 31 papers. the special focus in this conference is on logicprogramming and nonmonotonicreasoning. the topics include: the design of the seventh answer set programming competition;from logicprogramming and non-monotonic reasoning to computational argumentation and beyond;modular construction of minimal models;a hasse diagram for weighted sceptical semantics with a unique-status grounded semantics;foundations for a probabilistic event calculus;usually birds can abductively fly;a monotonic view on reflexive autoepistemic reasoning;minimal inference problem over finite domains;gelfond-zhang aggregates as propositional formulas;answer set solving with bounded treewidth revisited;vicious circle principle and formation of sets in asp based languages;answer set programs with queries over subprograms;explaining inconsistency in answer set programs and extensions;answer set programming with graded modality;a normalization tool for extended logic programs;a system for random testing in asp;a mobile app for argumentation;generating test suites of constrained combinatorial testing with answer set programming;automatic synthesis of optimal-size concentrators by answer set programming;towards effective asp planning;nurse scheduling via answer set programming;hybrid metabolic network completion;interpreting dynamic logic programs via multi-shot answer set programming and adjudication of coreference annotations via answer set optimization.
the proceedings contain 34 papers. the special focus in this conference is on logicprogramming and nonmonotonicreasoning. the topics include: Strong and weak constraints in disjunctive datalog;non-monotonic reasonin...
ISBN:
(纸本)9783540632559
the proceedings contain 34 papers. the special focus in this conference is on logicprogramming and nonmonotonicreasoning. the topics include: Strong and weak constraints in disjunctive datalog;non-monotonic reasoning with quantified Boolean constraints;complexity of only knowing;affordable classes of normal logic programs;automated reasoning with non-monotonic logics;simulations between programs as cellular automata;separating disbeliefs from beliefs in autoepistemic reasoning;resolution for skeptical stable semantics;computing non-ground representations of stable models;industry needs for integrated information services;towards a systematic approach to representing knowledge in declarative logicprogramming;a paraconsistent semantics with contradiction support detection;a general framework for revising non-monotonic theories;modular logicprogramming and generalized quantifiers;programs with universally quantified embedded implications;generalized query answering in disjunctive deductive databases;towards a disjunctive logicprogramming system;a deductive system for non-monotonic reasoning;flexible solutions to complex problems;an implementation of the stable model and well-founded semantics for normal lp;an implementation platform for query-answering in default logics and the x-ray system, its implementation and evaluation.
In answer set programming, two groups of rules are considered strongly equivalent if they have the same meaning in any context. Strong equivalence of two programs can be sometimes established by deriving rules of each...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
In answer set programming, two groups of rules are considered strongly equivalent if they have the same meaning in any context. Strong equivalence of two programs can be sometimes established by deriving rules of each program from rules of the other in an appropriate deductive system. this paper shows how to extend this method of proving strong equivalence to programs containing the counting aggregate.
the proceedings contain 4 papers. the topics discussed include: model streaming for distributed multi-context systems*;lightweight communication platform for heterogeneous multi-context systems: a preliminary report*;...
the proceedings contain 4 papers. the topics discussed include: model streaming for distributed multi-context systems*;lightweight communication platform for heterogeneous multi-context systems: a preliminary report*;towards a policy language for managing inconsistency in multi-context systems*;and privacy preservation using multi-context systems*.
the proceedings contain 25 papers. the special focus in this conference is on logicprogramming and nonmonotonicreasoning. the topics include: Founded World Views with Autoepistemic Equilibrium logic;towards Dynamic ...
ISBN:
(纸本)9783030205270
the proceedings contain 25 papers. the special focus in this conference is on logicprogramming and nonmonotonicreasoning. the topics include: 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;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 Probabilistic Action Language pBC+;Evaluation of Disjunctive Programs in WASP;telingo = ASP + Time;Telco Network Inventory Validation with NoHR;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;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;assessing Arguments with Schemes and Fallacies;simple Contrapositive Assumption-Based Frameworks;Argumentation-Based Explanations for Answer Sets Using ADF;treewidth and Counting Projected Answer Sets.
the proceedings contain 46 papers. the special focus in this conference is on logicprogramming and nonmonotonicreasoning. the topics include: Approximations for Explanations of Inconsistency in Partially Known Multi...
ISBN:
(纸本)9783642208942
the proceedings contain 46 papers. the special focus in this conference is on logicprogramming and nonmonotonicreasoning. the topics include: Approximations for Explanations of Inconsistency in Partially Known Multi-Context Systems;relational Information Exchange and Aggregation in Multi-Context Systems;stepping through an Answer-Set Program;dynamic Magic Sets for Programs with Monotone Recursive Aggregates;strong Equivalence of logic Programs with Abstract Constraint Atoms;Back and Forth between Rules and SE-Models;what Are the Necessity Rules in Defeasible reasoning?;partial Preferences and Ambiguity Resolution in Contextual Defeasible logic;on Influence and Contractions in Defeasible logicprogramming;foundations and Extensions of Answer Set programming: the logical Approach;termination of Grounding Is Not Preserved by Strongly Equivalent Transformations;aggregates in Answer Set Optimization;optimizing the Distributed Evaluation of Stratified Programs via Structural Analysis;contingency-Based Equilibrium logic;Weight Constraints with Preferences in ASP;parametrized Equilibrium logic;random vs. Structure-Based Testing of Answer-Set Programs: An Experimental Comparison;integrating Rules and Ontologies in the First-Order Stable Model Semantics (Preliminary Report);gentzen-Type Refutation Systems for three-Valued logics with an Application to Disproving Strong Equivalence;new Semantics for Epistemic Specifications;lessons from Efforts to Automatically Translate English to Knowledge Representation Languages;cmMUS: A Tool for Circumscription-Based MUS Membership Testing;transaction logic with External Actions;an Application of Clasp in the Study of logics;Industrial-Size Scheduling with ASP+CP;secommunity: A Framework for Distributed Access Control;itemset Mining as a Challenge Application for Answer Set Enumeration;causal reasoning for Planning and Coordination of Multiple Housekeeping Robots;advances in gringo Series 3.
Answer-set programming (ASP) is a declarative logicprogramming paradigm that provides an efficient problem-solving approach in logic-based artificial intelligence (AI). While it has proven successful, ASP encounters ...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
Answer-set programming (ASP) is a declarative logicprogramming paradigm that provides an efficient problem-solving approach in logic-based artificial intelligence (AI). While it has proven successful, ASP encounters specific situations where its language falls short of accurately representing and reasoning about incomplete information. Researchers now widely agree that ASP requires powerful introspective reasoning withthe use of epistemic modal operators;yet, despite long-lasting debates on how to extend ASP with such operators, they cannot reach a consensus on satisfactory semantics. Cabalar et al. argue that such research should be grounded in formal robustness. thus, inspired by ASP's foundational properties, they introduce a structural principle called epistemic splitting and designate it as one of the compulsory criteria for epistemic ASP. this paper generalises their approach to a more comprehensive, meticulous, and conservative extension of ASP-splitting, thereby enhancing its applicability and efficiency.
暂无评论