Sciweavers

746 search results - page 146 / 150
» Connectionist Propositional Logic
Sort
View
131
Voted
CHARME
2005
Springer
122views Hardware» more  CHARME 2005»
15 years 8 months ago
Regular Vacuity
The application of model-checking tools to complex systems involves a nontrivial step of modelling the system by a finite-state model and a translation of the desired properties i...
Doron Bustan, Alon Flaisher, Orna Grumberg, Orna K...
121
Voted
ATAL
2007
Springer
15 years 6 months ago
Model-based belief merging without distance measures
Merging operators try to define the beliefs of a group of agents according to the beliefs of each member of the group. Several model-based propositional belief merging operators h...
Verónica Borja Macías, Pilar Pozos P...
148
Voted
CASC
2006
Springer
128views Mathematics» more  CASC 2006»
15 years 6 months ago
New Domains for Applied Quantifier Elimination
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...
Thomas Sturm
141
Voted
AGP
1995
IEEE
15 years 6 months ago
A Prolog Implementation of Kem
In this paper, we describe a Prolog implementation of a new theorem prover for (normal propositional) modal and multi–modal logics. The theorem prover, which is called KEM, arise...
Alberto Artosi, Paola Cattabriga, Guido Governator...
162
Voted
LOGCOM
1998
178views more  LOGCOM 1998»
15 years 2 months ago
Applying the Mu-Calculus in Planning and Reasoning about Action
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
Munindar P. Singh