Sciweavers

4257 search results - page 60 / 852
» The Logical Modularity of Programs
Sort
View
ISMVL
2007
IEEE
91views Hardware» more  ISMVL 2007»
15 years 6 months ago
Non-deterministic Multi-valued Matrices for First-Order Logics of Formal Inconsistency
Paraconsistent logic is the study of contradictory yet non-trivial theories. One of the best-known approaches to designing useful paraconsistent logics is da Costa’s approach, w...
Arnon Avron, Anna Zamansky
FROCOS
2007
Springer
15 years 6 months ago
Idempotent Transductions for Modal Logics
Abstract. We investigate the extension of modal logics by bisimulation quantifiers and present a class of modal logics which is decidable when augmented with bisimulation quanti...
Tim French
CORR
1998
Springer
126views Education» more  CORR 1998»
14 years 11 months ago
Stable models and an alternative logic programming paradigm
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...
Victor W. Marek, Miroslaw Truszczynski
DALT
2009
Springer
15 years 4 months ago
Verifying Dribble Agents
Abstract. We describe a model-checking based approach to verification of programs written in the agent programming language Dribble. We define a logic (an extension of the branch...
Doan Thu Trang, Brian Logan, Natasha Alechina
DLOG
2008
15 years 2 months ago
Checking DL-Lite Modularity with QBF Solvers
We show how the reasoning tasks of checking various versions of conservativity for the description logic DL-Litebool can be reduced to satisfiability of quantified Boolean formulas...
Roman Kontchakov, Vladislav Ryzhikov, Frank Wolter...