This paper presents the planning system Pdk (Planning with Domain Knowledge), based on the translation of planning problems into Linear Time Logic theories, in such a way that finding solution plans is reduced to model search. The model search mechanism is based on temporal tableaux. The planning language accepted by the system allows one to specify extra problem dependent information, that can...

This paper is the first to examine the effect of minimum price guarantees in a sequential search model. Minimum price guarantees are not advertised and only known to consumers when they come to the shop. We show that in such an environment, minimum price guarantees increase the value of buying the good and therefore increase consumers’ reservation prices. This increase is so large that even aft...

We revisit the linear search problem where a robot, initially placed at the origin on an infinite line, tries to locate a stationary target placed at an unknown position on the line. Unlike previous studies, in which the robot travels along the line at a constant speed, we consider settings where the robot’s speed can depend on the direction of travel along the line, or on the profile of the te...

This paper studies a two-sided incomplete information bargaining model between a seller and a buyer. The buyer has an outside option, which is modeled as a sequential search process during which he can also choose to return to bargaining at any time. Two cases considered: In Regime I, both agents have symmetric information about the search parameters. We find that, in contrast to bargaining wit...

In this study, a Multi-Objective Genetic Algorithm (MOGA) is utilized to extract interpretable and compact fuzzy rule bases for modeling nonlinear Multi-input Multi-output (MIMO) systems. In the process of non- linear system identi cation, structure selection, parameter estimation, model performance and model validation are important objectives. Furthermore, se- curing low-level and high-level ...

We introduce the fast-mixed search model, which is a combination of the fast search model and the mixed search model. We establish relations between the fast-mixed search problem and other graph search problems. We also establish relations between the fast-mixed search problem and the inducedpath cover problem. We present linear-time algorithms for computing the fast-mixed search number and opt...

Of special interest in formal veriication are safety properties, which assert that the system always stays within some allowed region. Proof rules for the veriication of safety properties have been developed in the proof-based approach to veriication, making veriication of safety properties simpler than veriication of general properties. In this paper we consider model checking of safety proper...

Of special interest in formal verification are safety properties, which assert that the system always stays within some allowed region. Proof rules for the verification of safety properties have been developed in the proof-based approach to verification, making verification of safety properties simpler than verification of general properties. In this paper we consider model checking of safety p...