Sciweavers

10568 search results - page 699 / 2114
» Computer Intelligence and Formalization
Sort
View
LPAR
2007
Springer
16 years 1 months ago
Decidable Fragments of Many-Sorted Logic
We investigate the possibility of developing a decidable logic which allows expressing a large variety of real world specifications. The idea is to define a decidable subset of m...
Aharon Abadi, Alexander Moshe Rabinovich, Mooly Sa...
PRIMA
2007
Springer
16 years 1 months ago
An Asymmetric Protocol for Argumentation Games in Defeasible Logic
Agent interactions where the agents hold conflicting goals could be modelled as adversarial argumentation games. In many real-life situations (e.g., criminal litigation, consumer ...
Jenny Eriksson Lundström, Guido Governatori, ...
ISMVL
2006
IEEE
109views Hardware» more  ISMVL 2006»
16 years 1 months ago
Towards Solving Many-Valued MaxSAT
We define the MaxSAT problem for many-valued CNF formulas, called many-valued MaxSAT, and establish its complexity class. We then describe a basic branch and bound algorithm for ...
Josep Argelich, Xavier Domingo, Chu Min Li, Felip ...
ACRI
2006
Springer
16 years 1 months ago
Modeling Robot Path Planning with CD++
Robotic systems are usually built as independent agents that collaborate to accomplish a specific task. Analysis of robot path planning consists of route planning and path generati...
Gabriel A. Wainer
ICAIL
2005
ACM
16 years 24 days ago
Automatic semantics extraction in law documents
Normative texts can be viewed as composed by formal partitions (articles, paragraphs, etc.) or by semantic units containing fragments of a regulation (provisions). Provisions can ...
Carlo Biagioli, Enrico Francesconi, Andrea Passeri...