A5063459912- Logic, Reasoning, and Knowledge
- Multi-Agent Systems and Negotiation
- Semantic Web and Ontologies
- AI-based Problem Solving and Planning
- Logic, programming, and type systems
- Constraint Satisfaction and Optimization
- Formal Methods in Verification
- Service-Oriented Architecture and Web Services
- Biomedical Text Mining and Ontologies
- Topic Modeling
- Natural Language Processing Techniques
- Advanced Algebra and Logic
- Bayesian Modeling and Causal Inference
- Genomics and Phylogenetic Studies
- Data Management and Algorithms
- Business Process Modeling and Analysis
- Advanced Database Systems and Queries
- Digital Accessibility for Disabilities
- Auction Theory and Applications
- Tactile and Sensory Interactions
- Robotic Path Planning Algorithms
- Interactive and Immersive Displays
- Machine Learning and Algorithms
- Multimedia Communication and Technology
- Model-Driven Software Engineering Techniques
New Mexico State University
2016-2025
National Institute of Nutrition
2019-2023
The University of Texas at El Paso
1996-2023
Washington University in St. Louis
2022
University of Strathclyde
2022
King's College London
2022
University of Potsdam
2018
TED University
2018
Stanford University
2000-2001
The authors propose the markup of Web services in DAML family Semantic languages. This enables a wide variety agent technologies for automated service discovery, execution, composition and interoperation. present one such technology composition.
Abstract This technical note describes a monotone and continuous fixpoint operator to compute the answer sets of programs with aggregates. The relies on notion aggregate solution . Under certain conditions, this behaves identically three-valued immediate consequence Φ aggr P for programs, independently proposed in Pelov (2004) et al. (2004). allows us closely tie computational complexity set checking existence problems cost aggregates program. Finally, we relate semantics described by other...
Abstract The paper introduces the notion of offline justification for answer set programming (ASP). Justifications provide a graph-based explanation truth value an atom with respect to given set. extends also this atoms during computation (on-line justification) and presents integration online justifications within model Smodels . Offline useful tools enhance understanding ASP, they offer basic data structure support methodologies debugging programs. A preliminary implementation has been...
In Multi-Agent Path Finding (MAPF), a team of agents needs to find collision-free paths from their starting locations respective targets. Combined Target Assignment and (TAPF) extends MAPF by including the problem assigning targets as precursor problem. A limitation both models is assumption that number are equal, which invalid in some applications such autonomous warehouse systems. We address this generalizing TAPF allow for (1)~unequal tasks; (2)~tasks have deadlines they must be...
Bovine Ephemeral Fever (BEF), caused by an arthropod-borne rhabdovirus, is widespread in tropical and subtropical regions. It affects cattle with symptoms of fever, lameness, inappetence some situations can result mortality. The goal this study to determine if accelerometer data be used identify the behavior patterns that occur when become ill from BEF. Eight heifers a separate experiment were monitored 3-axis accelerometers sensors. Movement variation (MV) was calculated (25 Hz) using 1-min...
We present a declarative language, ${\cal PP}$ , for the high-level specification of preferences between possible solutions (or trajectories) planning problem. This novel language allows users to elegantly express non-trivial, multi-dimensional and priorities over such preferences. The semantics identification most preferred trajectories given goal. also provide an answer set programming implementation problems with
Abstract Explainable artificial intelligence (XAI) aims at addressing complex problems by coupling solutions with reasons that justify the provided answer. In context of Answer Set Programming (ASP) user may be interested in linking presence or absence an atom answer set to logic rules involved inference atom. Such explanations can given terms directed acyclic graphs (DAGs). This article reports on advancements development XAI system xASP revising main foundational notions and introducing...
In this article we consider three different kinds of domain-dependent control knowledge (temporal, procedural and HTN-based) that are useful in planning. Our approach is declarative relies on the language logic programming with answer set semantics (AnsProlog*). AnsProlog* designed to plan without knowledge. We show how temporal, HTN-based can be incorporated into by modular addition a small number rules, need modify planner. formally prove correctness our planner, both absence presence...
In this paper, we present two alternative approaches to defining answer sets for logic programs with arbitrary types of abstract constraint atoms (c-atoms). These generalize the fixpoint-based and level mapping based set semantics normal case c-atoms. The results are four different definitions which equivalent when applied programs. standard is generalized in directions, called by reduct complement. definitions, differ from each other treatment negation-as-failure (naf) atoms, make use an...
Escalating cost of treating chronic diseases demand that they be, to the extent possible, self-managed by patients. In self-management disease an imperative is predict, possible future state morbidity (at time, T¹), given present precursor conditions Tº) and expected condition T¹). This paper reports results a study evaluate potential use using TensorFlow Inpatient Databases at national level hospital for predicting asthma severity. Methods Deep Neural Networks (DNN) have been deployed in...
This paper presents two prototypical epistemic forward planners, called EFP and PG-EFP, for generating plans in multi-agent environments. These planners differ from recently developed that they can deal with unlimited nested beliefs, common knowledge, capable of both knowledge belief goals. is simply a breadth first search planner while PG-EFP heuristic based system. To generate heuristics the introduces notion an planning graph. The includes evaluation using benchmarks collected literature...
Elimination of chemically synthesized pesticides, such as fungicides and nematicides, in agricultural products is a key to successful practice the Vietnamese agriculture. We describe here route for developing biostimulants based on members Bacillus subtilis species complex. A number endospore-forming Gram-positive bacterial strains with antagonistic action against plant pathogens were isolated from crop plants. Based their draft genome sequence, thirty them assigned Most velezensis . Whole...
Abstract We extend the 0-approximation of sensing actions and incomplete information in Son Baral (2001) to action theories with static causal laws prove its soundness respect possible world semantics. also show that conditional planning problem this approximation is NP -complete. then present an answer set programming based planner, called ASCP, capable generating both conformant plans presence actions, about initial state, laws. correctness our implementation argue planner sound complete...
Information extraction systems are traditionally implemented as a pipeline of special-purpose processing modules targeting the particular kind information. A major drawback such an approach is that whenever new goal emerges or module improved, has to be reapplied from scratch entire text corpus even though only small part might affected. In this paper, we describe novel for information in which needs expressed form database queries, evaluated and optimized by systems. Using queries enables...