#### Filter Results:

- Full text PDF available (11)

#### Publication Year

2007

2016

- This year (0)
- Last five years (6)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Fernando Zacarías Flores, Dionicio Zacarías Flores, Rosalba Cuapa Canto, Luis Guzmán Muñoz
- Encyclopedia of Artificial Intelligence
- 2009

INTRODUCTION The agent paradigm has recently increased its influence in the research and development of computational logic-based systems. A clear and correct specification is made through Logic Programming (LP) and Non-nomotonic Reasoning that have been brought (back) to the spotlight. Also, the recent significant improvements in the efficiency of LP… (More)

—We consider the problem #2UNSAT (counting the number of falsifying assignments for two conjunctive forms). Because #2SAT (F) = 2 n #2UNSAT (F), results about #2UNSAT can dually be established for solving #2SAT. We establish the kind of two conjunctive formulas with a minimum number of falsifying assignment. As a result, we determine the formulas with a… (More)

- Fernando Zacarías Flores, José R. Arrazola Ramírez, Oscar Hernán Estrada-Estrada
- Engineering Letters
- 2007

- Guillermo De Ita Luna, Fernando Zacarías Flores, Luis Carlos Altamirano
- Computación y Sistemas
- 2015

The paper focuses on solving the Resource-Constrained Project Scheduling (RCPS) problem with a method based on intelligent agents. Parallelism for performing the tasks is allowed. Common and limited resources are available to all agents. The agents are non-cooperative and compete with each other for the use of common resources, thereby forming instances of… (More)

- Fernando Zacarias Flores, Rosalba Cuapa Canto, Erick Madrid
- 2013

- Fernando Zacarías Flores, Mauricio Osorio, Edgar Fernandez Plascencia
- Engineering Letters
- 2007

talking about knowledge and beliefs of an agent, we propose an extension of the AGM postulates based on these notions. To this extent we introduce a new principle of Irrelevance of Syntax. We present a slight version of the updated operator as defined under Pstable models that satisfies this principle. I. INTRODUCTION The A-Prolog (Stable Logic Programming… (More)

We present some results about the parametric complexity for counting the number of truth assignments for two Conjunctive Forms (2-CF's), such problem is denoted as #2SAT. It is common to analyze the computational complexity for #2SAT regarding the number of variables or the number of clauses on the input formula F We consider here, the time complexity… (More)

- Fernando Uceda Ponga, Fernando Zacarías Flores, Dionicio Zacarías Flores
- Engineering Letters
- 2007

present an implementation of pstable model semantics. Our implementation uses the well known tools: MiniSat and Lparse. Also we show the utility of an automatic demonstrator implemented with these tools for applications where the logic has consistence problems. I. INTRODUCTION The stable model semantics for logic programming support it self within the… (More)

- Alma Delia García, Guillermo De Ita Luna, Fernando Zacarías Flores
- Research in Computing Science
- 2016

We consider a knowledge base (KB) K and a new information φ, both expressed in conjunctive form (CF), and present here, a novel, deterministic and correct algorithm for belief revision of φ in K. We denote our revision operator as: K′ = K ◦ φ. We introduce a novel logical binary operator Ind between two conjunctive forms, such that Ind(φ,K) generates also a… (More)