base types and disallows lambda abstractions and quantifiers. We show that this fragment has the finite model property and that satisfiability can be decided with a terminating ...
Memory logics are modal logics whose semantics is specified in terms of relational models enriched with additional data structure to represent memory. The logical language is then...
We study the logic of comparative concept similarity CSL introduced by Sheremet, Tishkovsky, Wolter and Zakharyaschev to capture a form of qualitative similarity comparison. In thi...
Situation Awareness (SA) is the problem of comprehending elements of an environment within a volume of time and space. It is a crucial factor in decision-making in dynamic environm...
Franz Baader, Andreas Bauer 0002, Peter Baumgartne...
We consider two sequent calculi for tense logic in which the syntactic judgements are nested sequents, i.e., a tree of traditional onesided sequents built from multisets of formula...
Abstract. We give an optimal (exptime), sound and complete tableaubased algorithm for deciding satisfiability with respect to a TBox in the logic ALCI using global state caching. ...
We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the ...
Real-time strategy games share many aspects with real situations in domains such as battle planning, air traffic control, and emergency response team management which makes them a...
Ronald A. Metoyer, Simone Stumpf, Christoph Neuman...
The so-called social Web has helped to change the very nature of the Internet by emphasising the role of our online experiences as new forms of content and service knowledge. User...
Pierre-Antoine Champin, Peter Briggs, Maurice Coyl...
Within the medical domain there are clear expectations as to how a patient should respond to treatments administered. When these responses are not observed it can be challenging fo...
Laura Moss, Derek H. Sleeman, Malcolm Sim, Malcolm...