FLAIRS
2006
13 years 6 months ago
2006
In this paper, we describe curricular materials that use the game of Clue to teach basic concepts of propositional logic. While there are many ways of teaching concepts of logic, ...
FOIKS
2008
Springer
13 years 6 months ago
2008
Springer
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
FORMATS
2004
Springer
13 years 8 months ago
2004
Springer
Abstract. In this paper we report a new SAT solver for difference logic, a propositional logic enriched with timing constraints. The main novelty of our solver is a tighter integra...
IDA
2003
Springer
13 years 10 months ago
2003
Springer
The Fellegi-Holt method automatically “corrects” data that fail some predefined requirements. Computer implementations of the method were used in many national statistics bure...
SAT
2005
Springer
13 years 10 months ago
2005
Springer
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
FOSSACS
2005
Springer
13 years 10 months ago
2005
Springer
We present a general framework for logics of transition systems based on Stone duality. Transition systems are modelled as coalgebras for a functor T on a category X. The propositi...
TBILLC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We introduce an inquisitive semantics for a language of propositional logic, where the interpretation of disjunction is the source of inquisitiveness. Indicative conditio...
LPNMR
2007
Springer
2007
Springer
Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report
13 years 11 months ago
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
ICTAI
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper we consider the consistency problem of temporal or spatial qualitive constraint networks. A new encoding making it possible to represent and solve this problem in th...
FOCI
2007
IEEE
13 years 11 months ago
2007
IEEE
— The Constraint Satisfaction Problem (CSP) is one of the most prominent problems in artificial intelligence, logic, theoretical computer science, engineering and many other are...