the proceedings contain 10 papers. the special focus in this conference is on Web reasoning and Rule Systems. the topics include: Extending datalog intelligence;an ontology for historical research documents;semantic v...
ISBN:
(纸本)9783319220017
the proceedings contain 10 papers. the special focus in this conference is on Web reasoning and Rule Systems. the topics include: Extending datalog intelligence;an ontology for historical research documents;semantic views of homogeneous unstructured data;supportedly stable answer sets for logic programs with generalized atoms;planning with regression analysis in transaction logic;web ontology representation and reasoning via fragments of set theory;allotment problem in travel industry;a rule-based framework for creating instance data from openstreetmap;web stream reasoning in practice and a procedure for an event-condition-transaction language.
We describe a prototypical software framework for probabilistic inductive logicprogramming which supports the seamless combination of non-monotonic reasoning, probabilistic inference and parameter learning. While bui...
详细信息
ISBN:
(纸本)9783319235400;9783319235394
We describe a prototypical software framework for probabilistic inductive logicprogramming which supports the seamless combination of non-monotonic reasoning, probabilistic inference and parameter learning. While building upon existing as well as new approaches to probabilistic Answer Set programming, our framework distinguishes itself from related works by placing virtually no restrictions on the annotation of knowledge with probabilities. User-configurable algorithms provide for general as well as specialized, scalable approaches to inference and parameter learning, allowing for adaptability with regard to complex reasoning and weight learning tasks.
the proceedings contain 48 papers. the special focus in this conference is on logicprogramming and Nonmonotonic reasoning. 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 Nonmonotonic reasoning. 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.
this paper introduces the ongoing work for a novel domain-independent planning system which takes inspiration from both Constraint programming (CP) and logicprogramming (LP), flavouring it all with Object Oriented fe...
详细信息
ISBN:
(纸本)9783319243092;9783319243085
this paper introduces the ongoing work for a novel domain-independent planning system which takes inspiration from both Constraint programming (CP) and logicprogramming (LP), flavouring it all with Object Oriented features. We will see a specific customization of our environment to the particular kind of automated planning referred to as timeline-based. By allowing for the interesting ability of solving both planning and scheduling problems in a uniform schema, the resulting system is particularly suitable for complex domains arising from real dynamic scenarios. the paper proposes a resolution algorithm and enhances it with some (static and dynamic) heuristics to help the solving process. the system is tested on different benchmark problems from classical planning domains like the Blocks World to more challenging temporally expressive problems like the Temporal Machine Shop and the Cooking Carbonara problems demonstrating how the new planner, named iLoC, compares with respect to other state-of-the-art planners.
this work makes an overview on an hybrid formalism that combines the syntax of Linear-time Temporal logic (LTL) with a nonmonotonic selection of models based on Equilibrium logic. the resulting approach, called Tempor...
详细信息
In linear logic, formulas can be split into two sets: classical (those that can be used as many times as necessary) or linear (those that are consumed and no longer available after being used). Subexponentials general...
详细信息
ISBN:
(数字)9783662488997
ISBN:
(纸本)9783662488997;9783662488980
In linear logic, formulas can be split into two sets: classical (those that can be used as many times as necessary) or linear (those that are consumed and no longer available after being used). Subexponentials generalize this notion by allowing the formulas to be split into many sets, each of which can then be specified to be classical or linear. this flexibility increases its expressiveness: we already have adequate encodings of a number of other proof systems, and for computational models such as concurrent constraint programming, in linear logic with subexponentials (SEL). Bigraphs were proposed by Milner in 2001 as a model for ubiquitous computing, subsuming models of computation such as CCS and the pi-calculus and capable of modeling connectivity and locality at the same time. In this work we present an encoding of the bigraph structure in SEL, thus giving an indication of the expressive power of this logic, and at the same time providing a framework for reasoning and operating on bigraphs. Our encoding is adequate and therefore the operations of composition and juxtaposition can be performed on the logical level. Moreover, all the proof-theoretical tools of SEL become available for querying and proving properties of bigraph structures.
When constructing complex program analyses, it is often useful to reason about not just individual values, but collections of values. Symbolic set abstractions provide building blocks that can be used to partition ele...
详细信息
ISBN:
(纸本)9783662488997;9783662488980
When constructing complex program analyses, it is often useful to reason about not just individual values, but collections of values. Symbolic set abstractions provide building blocks that can be used to partition elements, relate partitions to other partitions, and determine the provenance of multiple values, all without knowing any concrete values. To address the simultaneous challenges of scalability and precision, we formalize and implement an interface for symbolic set abstractions and construct multiple abstract domains relying on both specialized data structures and off-the-shelf theorem provers. We develop techniques for lifting existing domains to improve performance and precision. We evaluate these domains on real-world data structure analysis problems.
Strong equivalence of logic programs is an important concept in the theory of answer set programming. Equilibrium logic was used to show that propositional formulas are strongly equivalent if and only if they are equi...
详细信息
We present an algorithm, CDCL-AMS, for solving Modular Systems consisting of a set of modules where, for each module, we have a simple "black-box" solver. the algorithm is based on the Conflict- Directed Cla...
详细信息
asprin offers a framework for expressing and evaluating combinations of quantitative and qualitative preferences among the stable models of a logic program. In this paper, we demonstrate the generality and flexibility...
详细信息
暂无评论