Search
Now showing items 911-920 of 976
Characterizing crawler behavior from web server access logs
(2003)
In this paper, we present a study of crawler behavior based on Web-server access logs. To this end, we use logs from five different academic sites in three countries. Based on these logs, we analyze the activity of different ...
Comparison of tree and straight-line clocking for long systolic arrays
(1991)
A critical problem in building long systolic arrays lies in efficient and reliable synchronization. We address this problem in the context of synchronous systems by introducing probabilistic models for two alternative clock ...
Classical methods in nonmonotonic reasoning
(1994)
In this paper we present and compare some classical problem solving methods for computing the stable models of a general propositional logic program. In particular linear programming, propositional satisfiability, constraint ...
The computational value of joint consistency
(1994)
In this paper we investigate the complexity of some recent reconstructions of Reiter's Default Logic using graph-theoretical structures. It turns out that requiring joint consistency of the justification of the applied ...
Plasp 3: Towards effective ASP planning
(2017)
We describe the new version of the PDDL-to-ASP translator plasp. First, it widens the range of accepted PDDL features. Second, it contains novel planning encodings, some inspired by SAT planning and others exploiting ASP ...
On the semantics of inheritance networks
(1992)
A semantics for inheritance reasoning is presented which allows both strict and defeasible knowledge to be represented. The approach proposed considers the semantics as consisting of two parts: the content theory which ...
μ-SATPLAN: Multi-agent planning as satisfiability
(2012)
Planning is a fundamental issue in multi-agent systems. In this work we focus on the coordination of multiple agents in two different settings. In the first, agents are able to attain individual goals that are necessary ...
Temporal planning through mixed integer programming: A preliminary report
(2002)
Temporal planning is an important problem, as in many real world planning domains actions have different durations and the goals should be achieved by a specified deadline, or as soon as possible. This paper presents a ...
Argumentation based modelling of embedded agent dialogues
(2006)
This paper presents a novel approach to modelling embedded agent dialogues. It proposes a specific structure for the supporting information accompanying the arguments that agents exchange during a dialogue, it defines ...
A Graph-Theoretic Approach to Default Logic
(1994)
A network representation of propositional seminormal disjunction-free default theories is presented, leading to a graph-theoretic approach to their analysis. The problem of finding an extension is proved to be equivalent ...