Sciweavers

3319 search results - page 29 / 664
» Subshifts, Languages and Logic
Sort
View
IJAR
2008
129views more  IJAR 2008»
13 years 8 months ago
Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the trea...
Teresa Alsinet, Carlos Iván Chesñeva...
DALT
2009
Springer
14 years 1 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
IPL
2006
120views more  IPL 2006»
13 years 8 months ago
Propositional dynamic logic of context-free programs and fixpoint logic with chop
This paper compares Propositional Dynamic Logic of Non-Regular Programs and Fixpoint Logic with Chop. It identifies a fragment of the latter which is equiexpressive to the former....
Martin Lange, Rafal Somla
ICLP
2011
Springer
13 years 5 days ago
Constraints in Non-Boolean Contexts
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
Leslie De Koninck, Sebastian Brand, Peter J. Stuck...
ENTCS
2006
117views more  ENTCS 2006»
13 years 8 months ago
Monadic Second-Order Logic and Transitive Closure Logics over Trees
Model theoretic syntax is concerned with studying the descriptive complexity of grammar formalisms for natural languages by defining their derivation trees in suitable logical for...
Hans-Jörg Tiede, Stephan Kepser