the proceedings contain 23 papers. the special focus in this conference is on Semantic Technology. the topics include: Missing RDF triples detection and correction in knowledge graphs;a new sentiment and topic model f...
ISBN:
(纸本)9783319706818
the proceedings contain 23 papers. the special focus in this conference is on Semantic Technology. the topics include: Missing RDF triples detection and correction in knowledge graphs;a new sentiment and topic model for short texts on social media;semi-supervised stance-topic model for stance classification on social media;mining inverse and symmetric axioms in linked data;enhancing knowledge graph embedding from a logical perspective;cross-lingual taxonomy alignment with bilingual knowledge graph embeddings;KG-Buddhism: the Chinese knowledge graph on Buddhism;Semantic graph analysis for federated LOD surfing in life sciences;development of semantic web-based imaging database for biological morphome;data structuring for launching web services triggered by media content;user participatory construction of open hazard data for preventing bicycle accidents;semantic IoT: Intelligent water management for efficient urban outdoor water conservation;semantically enhanced case adaptation for dietary menu recommendation of diabetic patients;linked urban open data including social problems’ causality and their costs;Refined JST thesaurus extended with data from other open life science data sources;Refinement-based OWL class induction with convex measures;reasoning on context-dependent domain models;Energy-efficiency of OWL reasoners—frequency matters;the identity problem in description logic ontologies and its application to view-based information hiding;Resolving range violations in DBpedia;entity linking in queries using word, mention and entity joint embedding.
the proceedings contain 43 papers. the special focus in this conference is on logic for programming, Artificial Intelligence, and reasoning. the topics include: Skolemization for substructural logics;reasoning about e...
ISBN:
(纸本)9783662488980
the proceedings contain 43 papers. the special focus in this conference is on logic for programming, Artificial Intelligence, and reasoning. the topics include: Skolemization for substructural logics;reasoning about embedded dependencies using inclusion dependencies;a tool for solving general deductive games;on anti-subsumptive knowledge enforcement;value sensitivity and observable abstract values for information flow control;fairly efficient machine learning connection prover;decidability, introduction rules and automata;analyzing internet routing security using model checking;boolean formulas for the static identification of injection attacks in java;an adequate compositional encoding of bigraph structure in linear logic with subexponentials;controller synthesis for MDPs and frequency LT\GU;automated benchmarking of incremental SAT and QBF solvers;a labelled sequent calculus for intuitionistic public announcement logic;implicit computational complexity of subrecursive definitions and applications to cryptographic proofs;tools for inductive provers;verification of concurrent programs using trace abstraction refinement;synchronized recursive timed automata;focused labeled proof systems for modal logic;on subexponentials, synthetic connectives, and multi-level delimited control;on the expressive power of communication primitives in parameterised systems;fine grained SMT proofs for the theory of fixed-width bit-vectors;abstract domains and solvers for sets reasoning;relational reasoning via probabilistic coupling;a contextual logical framework;enhancing search-based QBF solving by dynamic blocked clause elimination;reasoning about loops using vampire in key;compositional propositional proofs;normalisation by completeness with heyting algebras and using program synthesis for program analysis.
this paper is focused on looking for an appropriate coherence notion which allows us to deal with inconsistent information included in multi-adjoint normal logic programs. Different definitions closely related to the ...
详细信息
Static analysis of binary code is challenging for several reasons. In particular, standard static analysis techniques operate over control-flow graphs, which are not available when dealing with self-modifying programs...
详细信息
Static analysis of binary code is challenging for several reasons. In particular, standard static analysis techniques operate over control-flow graphs, which are not available when dealing with self-modifying programs which can modify their own code at runtime. We formalize in the Coq proof assistant some key abstract interpretation techniques that automatically extract memory safety properties from binary code. Our analyzer is formally proved correct and has been run on several self-modifying challenges, provided by Cai et al. in their PLDI 2007 article.
Modelling, reasoning and verifying complex situations involving a system of agents is crucial in all phases of the development of a number of safety-critical systems. In particular, it is of fundamental importance to ...
详细信息
Modelling, reasoning and verifying complex situations involving a system of agents is crucial in all phases of the development of a number of safety-critical systems. In particular, it is of fundamental importance to have tools and techniques to reason about the doxastic and epistemic states of agents, to make sure that the agents behave as intended. In this paper we introduce a computationally grounded logic called COGWED and we present two types of semantics that support a range of practical situations. We provide model checking algorithms, complexity characterisations and a prototype implementation. We validate our proposal against a case study from the avionic domain: we assess and verify the situational awareness of pilots flying an aircraft with several automated components in off-nominal conditions.
automated Offline programming (AOLP) is an emerging programming paradigm where industrial robot programs are generated from computer models with minimal human effort. Arc welding, such as Gas Metal Arc Welding (GMAW) ...
详细信息
ISBN:
(纸本)9781538604915
automated Offline programming (AOLP) is an emerging programming paradigm where industrial robot programs are generated from computer models with minimal human effort. Arc welding, such as Gas Metal Arc Welding (GMAW) or Tungsten Inert Gas (TIG), is particularly suited for this application due to the unique retooling requirements. A key aspect of the AOLP process is the determination of accurate welding paths. We present a novel algorithm to extract accurate welding paths for regular or irregular 3D bodies. Our process is computationally inexpensive with processing times less than a second for typical applications. We detail three examples with a range of complexity and examine the accuracy of the results and computational performance.
In this paper we propose a method for modeling social influence within the STIT approach to action. Our proposal consists in extending the STIT language with special operators that allow us to represent the consequenc...
详细信息
In this paper we propose a method for modeling social influence within the STIT approach to action. Our proposal consists in extending the STIT language with special operators that allow us to represent the consequences of an agent's choices over the rational choices of another agent.
We present a mechanised semantics for higher-order logic (HOL), and a proof of soundness for the inference system, including the rules for making definitions, implemented by the kernel of the HOL Light theorem prover....
详细信息
We present a mechanised semantics for higher-order logic (HOL), and a proof of soundness for the inference system, including the rules for making definitions, implemented by the kernel of the HOL Light theorem prover. Our work extends Harrison's verification of the inference system without definitions. Soundness of the logic extends to soundness of a theorem prover, because we also show that a synthesised implementation of the kernel in CakeML refines the inference system. Apart from adding support for definitions and synthesising an implementation, we improve on Harrison's work by making our model of HOL parametric on the universe of sets, and we prove soundness for an improved principle of constant specification in the hope of encouraging its adoption. Our semantics supports defined constants directly via a context, and we find this approach cleaner than our previous work formalising Wiedijk's Stateless HOL.
Calibrating stochastic biochemical models against experimental insights remains a critical challenge in biological design automation. Stochastic biochemical models incorporate the uncertainty inherent in the system be...
详细信息
ISBN:
(纸本)9781538625958
Calibrating stochastic biochemical models against experimental insights remains a critical challenge in biological design automation. Stochastic biochemical models incorporate the uncertainty inherent in the system being modeled, thus demanding meticulous calibration techniques. We present an approach for calibrating stochastic biochemical models such that the calibrated model satisfies a given behavioral temporal logic specification with a given probability. Model calibration is defined as an optimization problem that aims to minimize a cost function that computes either a qualitative or a quantitative measure of distance between the parameterized stochastic biochemical model and the expected behavioral specification. To minimize this distance, our approach combines various statistical hypothesis testing methods withautomated runtime monitoring of high-level temporal logic specifications against time-series data obtained by simulating stochastic models. We apply sequential probability ratio test (SPRT) and Bayesian statistical model checking (BSMC) when the distance between the model and the behavioral specification is a qualitative value. Alternatively, when the distance is a quantitative value describing how well a specification is satisfied by the model, we use a hypothesis test to sequentially select between two distributions of the distance metric that has the larger mean. Such tests describe the stopping condition to reduce the number of samples required for discovering the correct parameter values. We demonstrate the potential of our approach on two examples using agent-based models implemented in SPARK and rule-based models implemented in BioNetGen modeling languages. the distance between a candidate biochemical model and an expected behavior encoded in temporal logic can be used to drive a local or global search technique during the model calibration process. Our approach follows Simulated Annealing as the global search algorithm that avoids local minima
this study aims to support the coalition for abaca rehabilitation program of Southern Leyte State University(SLSU)and the different cooperating agencies of Southern Leyte. this is with use of intelligent systems in th...
详细信息
this study aims to support the coalition for abaca rehabilitation program of Southern Leyte State University(SLSU)and the different cooperating agencies of Southern Leyte. this is with use of intelligent systems in the grading of abaca tissue culture contamination. Since the abaca tissue culture laboratory is doing manual grading of the contaminated specimen, the use of image acquisition technology such can lessen the human interaction. Fuzzy logic is being used in the grading of the contamination. there are five(5) inputs for the inference engine namely red, green, blue, whitish and brownish. there are 62 rules identified covering the different combinations and the triangular-shaped membership function is used for all the membership types of the inputs. Based on the result of the testing, it has an accuracy rate of 82.00% for the binary contamination in 50 sample specimens and over-all accuracy of 80.33% in multiclass contamination grading. the system could not match the precision of the human expert, but the model is comparable to that of the expected actual result while minimizing the human intervention in the grading the contamination of abaca tissue culture.
暂无评论