the proceedings contain 27 papers. the topics discussed include: geometric reasoning on the traveling salesperson problem: comparing answer set programming and constraint logicprogramming approaches;routing and sched...
the proceedings contain 27 papers. the topics discussed include: geometric reasoning on the traveling salesperson problem: comparing answer set programming and constraint logicprogramming approaches;routing and scheduling in different ways: abridged preliminary report;explanation graphs for stable models of labelled logic programs;introducing ASP recipes and ASP chef;explanation graphs for stable models of labelled logic programs;preferential reasoning with typicality in ASP over weighted argumentation graphs in a gradual semantics;expanding the class of polynomial time computable well-founded semantics for hybrid MKNF;recursive aggregates as intensional functions;semantically guided scene generation via contextual reasoning and algebraic measures;value awareness and process automation: a reflection through school place allocation models;and argument analysis using answer set programming and semantics-guided large language models.
the proceedings contain 52 papers. the topics discussed include: complexity and scalability of reasoning in many-valued weighted knowledge bases with typicality;benchmarking for integrating logic rules with everything...
the proceedings contain 52 papers. the topics discussed include: complexity and scalability of reasoning in many-valued weighted knowledge bases with typicality;benchmarking for integrating logic rules with everything else;explanations for answer set programming;a dataflow analysis for comparing and reordering predicate arguments;towards a rule-based approach for deriving abstract domains;‘would life be more interesting if I were in AI?’ answering counterfactuals based on probabilistic inductive logicprogramming;multiple query satisfiability of constrained horn clauses;towards one-shot learning for text classification using inductive logicprogramming;on the potential of CLIP for compositional logical reasoning;and bottom-up stratified probabilistic logicprogramming with Fusemate.
the proceedings contain 39 papers. the topics discussed include: two languages, one system: tightly connecting XSB Prolog and Python;probabilistic logicprogramming: semantics, inference and learning;50th anniversary ...
the proceedings contain 39 papers. the topics discussed include: two languages, one system: tightly connecting XSB Prolog and Python;probabilistic logicprogramming: semantics, inference and learning;50th anniversary of the birth of prolog: some reflections on prolog's evolution, status, and future;tree-like justification systems are consistent;a preliminary data-driven analysis of common errors encountered by novice SPARC programmers;solving problems in PH with ASP(Q): preliminary results;on model reconciliation: how to reconcile when robot does not know human's model?;towards stream reasoning with deadlines;a fixpoint characterization of three-valued disjunctive hybrid MKNF knowledge bases;an iterative fixpoint semantics for MKNF hybrid knowledge bases with function symbols;and jumping evaluation of nested regular path queries.
the proceedings contain 39 papers. the special focus in this conference is on logicprogramming and Nonmonotonic Reasoning. the topics include: Deep Learning for the Generation of Heuristics in Answer Set programming:...
ISBN:
(纸本)9783031157066
the proceedings contain 39 papers. the special focus in this conference is on logicprogramming and Nonmonotonic Reasoning. the topics include: 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;modal logic S5 in Answer Set programming with Lazy Creation of Worlds;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;Solving Problems in the Polynomial Hierarchy with ASP(Q);Enumeration of Minimal Models and MUSes in WASP;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 Solving Based on Encoding Selection;QMaxSATpb: A Certified MaxSAT Solver;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;statis
this paper presents a language, Alda, that supports all of logic rules, sets, functions, updates, and objects as seamlessly integrated built-ins. the key idea is to support predicates in rules as set-valued variables ...
详细信息
this paper presents a language, Alda, that supports all of logic rules, sets, functions, updates, and objects as seamlessly integrated built-ins. the key idea is to support predicates in rules as set-valued variables that can be used and updated in any scope, and support queries using rules as either explicit or implicit automatic calls to an inference function. We have defined a formal semantics of the language, implemented a prototype compiler that builds on an object-oriented language that supports concurrent and distributed programming and on an efficient logic rule system, and successfully used the language and implementation on benchmarks and problems from a wide variety of application domains. We describe the compilation method and results of experimental evaluation.
the proceedings contain 26 papers. the topics discussed include: geometric and spatial reasoning in BDI agents: a survey;on modal logic formulae minimization;on generalized Ackermann encodings - the basis issue;logic ...
the proceedings contain 26 papers. the topics discussed include: geometric and spatial reasoning in BDI agents: a survey;on modal logic formulae minimization;on generalized Ackermann encodings - the basis issue;logicprogramming for knowledge graph completion;on two-variable first-order logic with a partial order;structured declarative language;preserving privacy in a (timed) concurrent language for argumentation;nuclear medicine scheduling via answer set programming;a semantics-aware evaluation order for abstract argumentation frameworks;solver fast prototyping for Reduct-based ELP semantics;NEMO - a neural, emotional architecture for human-ai teaming;a description logics based cognitively inspired tool for knowledge generation via concept combination;and Concept2Text: an explainable multilingual rewriting of concepts into natural language.
logical flaws in smart contracts are often exploited, leading to significant financial losses. Our tool, HighGuard, detects transactions that violate business logic specifications of smart contracts. HighGuard employs...
详细信息
ISBN:
(纸本)9798400712487
logical flaws in smart contracts are often exploited, leading to significant financial losses. Our tool, HighGuard, detects transactions that violate business logic specifications of smart contracts. HighGuard employs dynamic condition response (DCR) graph models as formal specifications to verify contract execution against these models. It is capable of operating in a cross-chain environment for detecting business logic flaws across different blockchain platforms. We demonstrate HighGuard's effectiveness in identifying deviations from specified behaviors in smart contracts without requiring code instrumentation or incurring additional gas costs. By using precise specifications in the monitor, HighGuard achieves detection without false positives. Our evaluation, involving 54 exploits, confirms HighGuard's effectiveness in detecting business logic vulnerabilities. Our open-source implementation of HighGuard and a screencast of its usage are available at: https://***/mojtaba-eshghie/HighGuard https://***/watch?v=sZYVV-slDaY
We present CoVeriTeam GUI, a No-Code web frontend to compose new software-verification workflows from existing analysis techniques. Verification approaches stopped relying on single techniques years ago, and instead c...
详细信息
ISBN:
(数字)9798400712487
ISBN:
(纸本)9798400712487
We present CoVeriTeam GUI, a No-Code web frontend to compose new software-verification workflows from existing analysis techniques. Verification approaches stopped relying on single techniques years ago, and instead combine selections that complement each other well. So far, such combinations were-under high implementation and maintenance cost-glued together with proprietary code. Now, CoVeriTeam GUI enables users to build new verification workflows without programming. Verification techniques can be combined through various composition operators in a drag-and-drop fashion directly in the browser, and an integration with a remote service allows to execute the built workflows withthe click of a button. CoVeriTeam GUI is available open source under Apache 2.0: https://***/sosy- lab/software/coveriteam-gui Demonstration video: https://***/oZoOARuIOuA
this paper describes a formal repair framework for performance bugs in loop programs, which are programming errors that slow down program execution. the approach is developed based on the observation that a program wi...
详细信息
ISBN:
(数字)9798400712487
ISBN:
(纸本)9798400712487
this paper describes a formal repair framework for performance bugs in loop programs, which are programming errors that slow down program execution. the approach is developed based on the observation that a program with a performance bug is a semantically correct program, but it may perform inefficiently for some inputs. this observation permits the formal treatment of performance bugs using the idea of program invariants, where the original program is augmented with a number of non-functional variables that are used to assess the efficiency of the patched version vs. the original program using the derived invariants. the proposed approach offers two major advantages compared to the conventional test-based patch validation approach. First, it enables the formal validation of patches using program verifiers. Second, it helps to assess the efficiency boost provided by the generated patches. To the best of our knowledge, the formal treatment of performance bugs has not been studied in the prior literature.
暂无评论