Arrow Research search

Author name cluster

Jürgen Dix

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

18 papers
2 author rows

Possible papers

18

FLAP Journal 2025 Journal Article

Formal Argumentation and Modal Logic

  • Carlos Iván Chesñevar
  • Jürgen Dix
  • Beishui Liao
  • Jieting Luo
  • Carlo Prioetti
  • Antonio Yuste-Ginel

The interrelationship between defeasible argumentation and modal logic is rooted in their shared goal of capturing and modelling reasoning under uncer- tainty and changing conditions. In the last years, researchers have explored different ways to combine these two formalizations to create more robust sys- tems for handling complex reasoning tasks, in which modal operators can be incorporated into argumentation systems.

IS Journal 2023 Journal Article

AI’s 10 to Watch, 2022

  • Jürgen Dix
  • Zhongfei Zhang

IEEE Intelligent Systems is promoting young and aspiring artificial intelligence (AI) scientists and recognizing the rising stars as “AI‘s 10 Watch. ” This biennial 2022 edition is slightly different from the previous editions: We solicited submissions from individuals who had obtained their Ph. D. up to 10 years prior (as opposed to 5 years in all of the previous editions). This led to more applications of the highest quality. The selection committee finally had to select 10 outstanding contributors from a pool of 30+ highly competitive and strong nominations, which made the selection decisions rather difficult. After a careful and detailed selection process through many rounds of discussions via e-mails and live meetings, the committee voted unanimously on a short list of 10 top candidates who have all demonstrated outstanding achievements in different areas of AI. The selection was based solely on scientific quality, reputation, impact, and expert endorsements accumulated since their Ph. D. It is our honor and privilege to announce the following 2022 class of “AI’s 10 to Watch. ”• Bo Li. She is working on trustworthy machine learning (ML) at the intersection of ML, security and privacy, and game theory. She was able to integrate domain knowledge and logical reasoning abilities into data-driven statistical ML models to improve learning robustness with guarantees, and she has designed scalable privacy-preserving data-publishing frameworks for high-dimensional data. Her work has provided rigorous guarantees for the trustworthiness of learning systems and been deployed in industrial applications. She is an assistant professor with the University of Illinois at Urbana-Champaign. • Tongliang Liu. He is working in the fields of trustworthy ML. His work in theories and algorithms of ML with noisy labels has led to significant contributions and influence in the fields of ML, computer vision, natural language processing (NLP), and data mining, as large-scale datasets in those fields are prone to suffering severe label errors. He is a senior lecturer at the School of Computer Science, University of Sydney, and a visiting associate professor at the Department of Machine Learning, Mohamed bin Zayed University of Artificial Intelligence. • Liqiang Nie. He is the dean of and a professor with the School of Computer Science and Technology, Harbin Institute of Technology (Shenzhen). He works on multimedia content analysis and search, with a particular emphasis on data-driven multimodal learning and knowledge-guided multimodal reasoning. He pioneered the explicit modeling of consistent, complementary, and partial alignment relationships among modalities. • Soujanya Poria. He is an assistant professor at Singapore University of Technology and Design (SUTD). His seminal research on fusing information from textual, audio, and visual modalities for diverse behavioral and affective tasks significantly improved systems reliant on multimodal data, paving the way to various novel research avenues. His latest works are on information extraction, vision–language reasoning, and understanding human conversations in terms of common sense-based, context-grounded causal explanations. • Deqing Sun. He is a staff research scientist at Google. He has made significant contributions to computer vision, in particular in motion estimation. His work on optical flow (“Classic+NL” and “PWC-Net”) has been very influential and has been powering commercial applications such as Super SloMo in NVIDIA’s RTX platform, Face Unblur, and Fusion Zoom on Google’s Pixel phone. • Yizhou Sun. She is a pioneer in heterogeneous information network (HIN) mining, with a recent focus on deep graph learning, neural symbolic reasoning, and providing neural solutions to multiagent dynamical systems. Her work has a wide spectrum of applications, ranging from e-commerce, health care, and material science to hardware design. She is currently an associate professor at the University of California, Los Angeles (UCLA). • Jiliang Tang. He is a University Foundation Professor at Michigan State University. He works on graph ML and trustworthy AI and their applications in education and biology. His contributions to these fields include highly cited algorithms, well-received systems, and popular books. • Zhangyang “Atlas” Wang. He works on efficient and reliable ML. Recently, his core research theme is to leverage, understand, and expand the role of sparsity, from classical optimization to modern neural networks (NNs), whose impacts span the efficient training/inference of large-foundation models, robustness and trustworthiness, generative AI, graph learning, and more. • Hongzhi Yin. He has worked on trustworthy data intelligence to turn data into privacy-preserving, robust, explainable, and fair intelligent services in various industries and scenarios. He is also a leading expert researching and developing next-generation intelligent systems and algorithms for lightweight on-device predictive analytics as well as recommendation and decentralized ML on massive and heterogeneous data. He is an associate professor and ARC Future Fellow at the University of Queensland. • Liang Zheng. He is a senior lecturer at the Australian National University and works on data-centric computer vision, where he seeks to improve the quality of training and validation data, predict test data difficulty without labels, and more. These efforts provide a complementary perspective to model-centric developments. He has also made significant contributions to object re-identification and the broader smart city initiative through the introduction of widely used benchmarks and baseline methods.

AAAI Conference 2023 System Paper

DUCK: A Drone-Urban Cyber-Defense Framework Based on Pareto-Optimal Deontic Logic Agents

  • Tonmoay Deb
  • Jürgen Dix
  • Mingi Jeong
  • Cristian Molinaro
  • Andrea Pugliese
  • Alberto Quattrini Li
  • Eugene Santos, Jr
  • V.S. Subrahmanian

Drone based terrorist attacks are increasing daily. It is not expected to be long before drones are used to carry out terror attacks in urban areas. We have developed the DUCK multi-agent testbed that security agencies can use to simulate drone-based attacks by diverse actors and develop a combination of surveillance camera, drone, and cyber defenses against them.

AAMAS Conference 2021 Conference Paper

Feasible Coalition Sequences

  • Tabajara Krausburg
  • Jürgen Dix
  • Rafael H. Bordini

We introduce the idea of a finite sequence of coalition formation games over a set of agents, and we call it Sequential Characteristic- Function Game (SCFG). We define the solution of such a game as a corresponding sequence of coalition structures that must be related by a given feasibility relation, so no coalition structure can be evaluated in isolation. A sequence satisfying this condition is called Feasible Coalition-Structure Sequence (FCSS). Such games can be a useful abstraction for modelling various scenarios, in particular those for real-world disaster management that we consider in this paper. We give an algorithm for computing an FCSS and evaluate it experimentally. Our results show that an SCFG can represent various classical variations of characteristic-function games, and our algorithm solves instances with a reasonable number of agents.

EUMAS Conference 2020 Conference Paper

Disaster Response Simulation as a Testbed for Multi-Agent Systems

  • Tabajara Krausburg
  • Vinicius Chrisosthemos
  • Rafael H. Bordini
  • Jürgen Dix

Abstract We introduce a novel two-dimensional simulator for disaster response on maps of real cities. Our simulator deals with logistics and coordination problems and allows to plug-in almost any approach developed for simulated environments. In addition, it (1) offers functionalities for further developing and benchmarking, and (2) provides metrics that help the analysis of the performance of a team of agents during the disaster. Our simulator is based on software made available by the multi-agent programming contest, which over the years has provided challenging problems to be solved by intelligent agents. We evaluate the performance of our simulator in terms of processing time and memory usage, message exchange, and response time. We apply this analysis to two different approaches for dealing with the mining dam disaster that occurred in Brazil in 2019. Our results show that our simulator is robust and can work with a reasonable number of agents.

EUMAS Conference 2016 Conference Paper

Agent-Based Simulation for Software Development Processes

  • Tobias Ahlbrecht
  • Jürgen Dix
  • Niklas Fiekas
  • Jens Grabowski
  • Verena Herbold
  • Daniel Honsel
  • Stephan Waack
  • Marlon Welter

Abstract Software development is a costly process and requires serious quality control on the management level: Managing a project with more than 10 programmers over several years is a highly nontrivial task. We are building tools for helping the manager to predict the future development of the project based on certain adjustable parameters. The main idea is to view the software process as agent-based simulation in a multiagent system (MAS). This approach requires combining three different areas: (1) mining patterns from past projects, (2) modeling the software development process in a multiagent environment, and (3) running the simulation on a scalable multiagent platform.

EUMAS Conference 2016 Conference Paper

Scalable Multi-agent Simulation Based on MapReduce

  • Tobias Ahlbrecht
  • Jürgen Dix
  • Niklas Fiekas

Abstract Jason is perhaps the most advanced multi-agent programming language based on AgentSpeak. Unfortunately, its current Java-based implementation does not scale up and is seriously limited for simulating systems of hundreds of thousands of agents. We are presenting a scalable simulation platform for running huge numbers of agents in a Jason style simulation framework. Our idea is (1) to identify independent parts of the simulation in order to parallelize as much as possible, and (2) to use and apply existing technology for parallel processing of large datasets (e. g. MapReduce ). We evaluate our approach on an early benchmark and show that it scales up linearly (in the number of agents).

EUMAS Conference 2006 Conference Paper

Model Checking Abilities under Incomplete Information Is Indeed Delta2-complete

  • Wojciech Jamroga
  • Jürgen Dix

We study the model checking complexity of Alternating-time temporal logic with imperfect atlir ). Contrary to what we have stated in [11], the problem turns out to be ∆P 2 -complete, thus con rming the initial intuition of Schobbens [18]. We prove P ∆P 2 -hardness through a reduction of the SNSAT problem, while the membership in ∆2 stems from the algorithm presented in [18].

LPAR Conference 2005 Conference Paper

The Relationship Between Reasoning About Privacy and Default Logics

  • Jürgen Dix
  • Wolfgang Faber 0001
  • V. S. Subrahmanian

Abstract There is now an incredible wealth of data about individuals, businesses and organisations. This data is freely available over the Internet to almost anyone willing to pay for it, independently of whether they are identity thieves or credit card scam artists or legitimate users. This has led to a growing need for privacy. In this paper, we first present a simple logical model of privacy. We then show that the problem of privacy may be reduced to that of brave reasoning in default logic theories, thus reducing this important problem to a well understood reasoning paradigm. By leveraging this reduction, we are able to develop an efficient privacy preservation algorithm and a set of complexity results for privacy preservation. Efficient systems based on answer set programming are available to implement our algorithm.

TCS Journal 2003 Journal Article

Relating defeasible and normal logic programming through transformation properties

  • Carlos Iván Chesñevar
  • Jürgen Dix
  • Frieder Stolzenburg
  • G.R.Guillermo Ricardo Simari

This paper relates the Defeasible Logic Programming (DeLP) framework and its semantics SEM DeLP to classical logic programming frameworks. In DeLP, we distinguish between two different sorts of rules: strict and defeasible rules. Negative literals (∼A) in these rules are considered to represent classical negation. In contrast to this, in normal logic programming (NLP), there is only one kind of rules, but the meaning of negative literals (not A) is different: they represent a kind of negation as failure, and thereby introduce defeasibility. Various semantics have been defined for NLP, notably the well-founded semantics (WFS) (van Gelder et al. , Proceedings of the Seventh Symposium on Principles of Database Systems, 1988, pp. 221–230; J. ACM 38 (3) (1991) 620) and the stable semantics Stable (Gelfond and Lifschitz, Fifth Conference on Logic Programming, MIT Press, Cambridge, MA, 1988, pp. 1070–1080; Proceedings of the Seventh International Conference on Logical Programming, Jerusalem, MIT Press, Cambridge, MA, 1991, pp. 579–597). In this paper we consider the transformation properties for NLP introduced by Brass and Dix (J. Logic Programming 38(3) (1999) 167) and suitably adjusted for the DeLP framework. We show which transformation properties are satisfied, thereby identifying aspects in which NLP and DeLP differ. We contend that the transformation rules presented in this paper can help to gain a better understanding of the relationship of DeLP semantics with respect to more traditional logic programming approaches. As a byproduct, we obtain the result that DeLP is a proper extension of NLP.

JELIA Conference 2002 Conference Paper

Theoretical and Empirical Aspects of a Planner in a Multi-agent Environment

  • Jürgen Dix
  • Héctor Muñoz-Avila
  • Dana S. Nau
  • Lingling Zhang

Abstract We give the theoretical foundations and empirical evaluation of a planning agent, ashop, performing HTN planning in a multi-agent environment. ashop is based on ASHOP, an agentised version of the original SHOP HTN planning algorithm, and is integrated in the IMPACT multi-agent environment. We ran several experiments involving accessing various distributed, heterogeneous information sources, based on simplified versions of noncombatant evacuation operations, NEO’s. As a result, we noticed that in such realistic settings the time spent on communication (including network time) is orders of magnitude higher than the actual inference process. This has important consequences for optimisations of such planners. Our main results are: (1) using NEO’s as new, more realistic benchmarks for planners acting in an agent environment, and (2) a memoization mechanism implemented on top of shop, which improves the overall performance considerably.

TCS Journal 2001 Journal Article

Explaining updates by minimal sums

  • Karl Schlechta
  • Jürgen Dix

Human reasoning about developments of the world involves always an assumption of inertia. We discuss two approaches for formalizing such an assumption, based on the concept of an explanation: (1) there is a general preference relation ≺ given on the set of all explanations and (2) there is a notion of a distance between models and explanations are preferred if their sum of distances is minimal. Each distance dist naturally induces a preference relation ≺ dist. We show exactly under which conditions the converse is true as well and therefore both approaches are equivalent modulo these conditions. Our main result is a general representation theorem in the spirit of Kraus, Lehmann and Magidor.

TCS Journal 2001 Journal Article

On the equivalence of the static and disjunctive well-founded semantics and its computation

  • Stefan Brass
  • Jürgen Dix
  • Ilkka Niemelä
  • Teodor C. Przymusinski

In recent years, much work was devoted to the study of theoretical foundations of Disjunctive Logic Programming and Disjunctive Deductive Databases. While the semantics of non-disjunctive programs is fairly well understood, the declarative and computational foundations of disjunctive logic programming proved to be much more elusive and difficult. Recently, two new and promising semantics have been proposed for the class of disjunctive logic programs. The first one is the static semantics STATIC, proposed by Przymusinski, and, the other is the disjunctive well-founded semantics D-WFS, proposed by Brass and Dix. Although the two semantics are based on very different ideas, both of them have been shown to share a number of natural and intuitive properties. In particular, both of them extend the well-founded semantics of normal logic programs. Nevertheless, since the static semantics employs a much richer underlying language than the D-WFS semantics, in general, the two semantics are different. The main result of this paper shows, however, that, when restricted to a common language, the two semantics in fact coincide. This important result provides additional and powerful argument in favor of the two semantics. It also allows us to use a recently developed minimal model theorem prover for an efficient implementation of the two semantics.

AIJ Journal 2001 Journal Article

Temporal agent programs

  • Jürgen Dix
  • Sarit Kraus
  • V.S. Subrahmanian

The “agent program” framework introduced by Eiter, Subrahmanian and Pick [Artificial Intelligence 108 (1–2) (1999) 179], supports developing agents on top of arbitrary legacy code. Such agents are continuously engaged in an “eventoccurs→think→act→eventoccurs…” cycle. However, this framework has two major limitations: (1) all actions are assumed to have no duration, and (2) all actions are taken now, but cannot be scheduled for the future. In this paper, we present the concept of a “temporal agent program” (tap for short) and show that using taps, it is possible to build agents on top of legacy code that can reason about the past and about the future, and that can make temporal commitments for the future now. We develop a formal semantics for such agents, extending the concept of a status set proposed by Eiter et al. , and develop algorithms to compute the status sets associated with temporal agent programs. Last, but not least, we show how taps support the decision making of collaborative agents.

AIJ Journal 1999 Journal Article

Computation of the semantics of autoepistemic belief theories

  • Stefan Brass
  • Jürgen Dix
  • Teodor C. Przymusinski

Recently, one of the authors introduced a simple and yet powerful non-monotonic knowledge representation framework, called the Autoepistemic Logic of Beliefs, AEB. Theories in AEB are called autoepistemic belief theories. Every belief theory T has been shown to have the least static expansion T which is computed by iterating a natural monotonic belief closure operator Ψ T starting from T. This way, the least static expansion T of any belieftheory provides its natural non-monotonic semantics which is called the static semantics. It is easy to see that if a belief theory T is finite then the construction of its least static expansion T stops after countably many iterations. However, a somewhat surprising result obtained in this paper shows that the least static expansion of any finite belief theory T is in fact obtained by means of a single iteration of the belief closure operator Ψ T (although this requires T to be of a special form, we also show that T can be always put in this form). This result eliminates the need for multiple iterations in the computation of static semantics and allows us to replace the fixed-point definition of static semantics by the equivalent explicit and straightforward definition given by T=ΨT(T). The second, closely related result establishes an intriguing relationship between static semantics T and Clark's completions comp(T) of finite belief theories. Here we use a slightly generalized version of comp(T) (see Definition 3. 2). It shows that the static semantics T of T is obtained by augmenting T with the set Bcomp(T)={BF: F∈comp(T)} thus ensuring that all formulae that belong to Clark's completion comp(T) of T are believed to be true. Both results open the way for a more efficient implementation of static semantics: the first, because only one iteration is needed, and the second because reasoning in a non-standard logic (belief theories under static semantics) can be reduced to classical theorem proving involving Clark's completion.

v2026.09.13